Learn More
Nash-Williams and Tutte independently characterized when a graph has k edge-disjoint spanning trees; a consequence is that 2k-edge-connected graphs have k edge-disjoint spanning trees. Kriesell conjectured a more general statement: defining a set S ⊆ V (G) to be j-edge-connected in G if S lies in a single component of any graph obtained by deleting fewer(More)
a r t i c l e i n f o a b s t r a c t Nowhere zero flows Orientation It is shown that every (2p + 1) log 2 (|V (G)|)-edge-connected graph G has a mod (2p +1)-orientation, and that a (4p +1)-regular graph G has a mod (2p + 1)-orientation if and only if V (G) has a partition (V + , V −) such that ∀U ⊆ V (G), ∂ G (U) (2p + 1) U ∩ V + − U ∩ V −. These extend(More)
Thomassen conjectured that every 4-connected line graph is Hamiltonian. A vertex cut X of G is essential if G − X has at least two non-trivial components. We prove that every 3-connected, essentially 11-connected line graph is Hamiltonian. Using Ryjᢠcek's line graph closure, it follows that every 3-connected, essentially 11-connected claw-free graph is(More)
The Hadwiger number h(G) of a graph G is the maximum size of a complete minor of G. Hadwiger's Conjecture states that h(G) ≥ χ(G). Since χ(G)α(G) ≥ |V (G)|, Hadwiger's Conjecture implies that α(G)h(G) ≥ |V (G)|. We show that (2α(G) − ⌈log τ (τ α(G)/2)⌉)h(G) ≥ |V (G)| where τ ≈ 6.83. For graphs with α(G) ≥ 14, this improves on a recent result of(More)
Say that a graph with maximum degree at most d is d-bounded. For d > k, we prove a sharp sparseness condition for decomposability into k forests and a d-bounded graph. Consequences are that every graph with fractional arboricity at most k + d k+d+1 has such a decomposition, and (for k = 1) every graph with maximum average degree less than 2 + 2d d+2(More)
Noel, Reed, and Wu proved the conjecture of Ohba stating that the choice number of a graph G equals its chromatic number when |V (G)| ≤ 2χ(G) + 1. We extend this to a general upper bound: ch(G) ≤ max χ(G), |V (G)| + χ(G) − 1 3. For |V (G)| ≤ 3χ(G), Ohba provided examples where equality holds.
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G having no parity path (a parity edge-coloring). Let p(G) be the least number of colors in an edge-coloring of G having no open parity walk (a strong parity edge-coloring). Always p(G)(More)
A hub set in a graph G is a set U ⊆ V (G) such that any two vertices outside U are connected by a path whose internal vertices lie in U. We prove that h(G) ≤ h c (G) ≤ γ c (G) ≤ h(G) + 1, where h(G), h c (G), and γ c (G), respectively, are the minimum sizes of a hub set in G, a hub set inducing a connected subgraph, and a connected dominating set.(More)
We prove that for any constant k and any < 1, there exist bimatrix win-lose games for which every-WSNE requires supports of cardinality greater than k. To do this, we provide a graph-theoretic characterization of win-lose games that possess-WSNE with constant cardinality supports. We then apply a result in additive number theory of Haight [8] to construct(More)