JCT
2010
13 years 10 months ago
2010
JCT
2010
13 years 10 months ago
2010
JCT
2010
13 years 10 months ago
2010
We prove that for every k and every ε > 0, there exists g such that every graph with tree-width at most k and odd-girth at least g has circular chromatic number at most 2 + ε...
JCT
2010
13 years 10 months ago
2010
A lattice path matroid is a transversal matroid for which some antichain of intervals in some linear order on the ground set is a presentation. We characterize the minor-closed cla...
JCT
2010
13 years 10 months ago
2010
Abstract. For each finite field F of prime order there is a constant c such that every 4-connected matroid has at most c inequivalent representations over F. We had hoped that th...
JCT
2010
13 years 10 months ago
2010
We call a coloring of the edge set of a graph G a b-bounded coloring if no color is used more than b times. We say that a subset of the edges of G is rainbow if each edge is of a ...
JCT
2010
13 years 10 months ago
2010
JCT
2010
13 years 10 months ago
2010
We show that for each η > 0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d+ 1 ≤ · · · ≤ d+ n and d− 1 ≤ · · · ...
JCT
2010
13 years 10 months ago
2010
JCT
2010
13 years 10 months ago
2010
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...