139
Voted
DM
2016
10 years 1 months ago
2016
We determine the structure of clonal classes of 3-connected frame matroids in terms of the structure of biased graphs. Robbins has conjectured that a 3-connected nonuniform matroid...
68
Voted
DM
2016
10 years 1 months ago
2016
For a k-uniform hypergraph G with vertex set {1, . . . , n}, the ordered Ramsey number ORt(G) is the least integer N such that every t-coloring of the edges of the complete k-unifo...
67
Voted
DM
2016
10 years 1 months ago
2016
Let G = (V, E) be a graph of order n. A distance magic labeling of G is a bijection ℓ: V → {1, 2, . . . , n} for which there exists a positive integer k such that ∑ x∈N(v)...
70
Voted
DM
2016
10 years 1 months ago
2016
A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. We prove that for a given nullity more than 1, there are only finitely many in...
64
Voted
DM
2016
10 years 1 months ago
2016
In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. As an application, we obtain an interlacing property for th...