Add to ORKGAbstract. In 1963, Corrádi and Hajnal proved that for all k ≥ 1 and n ≥ 3k, every (simple) graph G on n vertices with minimum degree δ(G) ≥ 2k contains k disjoint cycles. The same year, Dirac described the 3-connected multigraphs not containing two disjoint cycles and asked the more general question: Which (2k − 1)-connected multigraphs do not contain k disjoint cycles? Recently, the authors characterized the simple graphs G with minimum degree δ(G) ≥ 2k − 1 that do not contain k disjoint cycles. We use this result to answer Dirac’s question in full
AbstractWe show that each finite undirected graph G = (V, E), |V| = n, |E|= m with minimum degree δ(...
AbstractHajnal and Corrádi proved that any simple graph on at least 3k vertices with minimal degree ...
AbstractLet Gn be a class of graphs on n vertices. For an integer c, let ex(Gn,c) be the smallest in...
Abstract. In 1963, Corrádi and Hajnal proved that for all k ≥ 1 and n ≥ 3k, every graph G on n vert...
AbstractWe propose the following conjecture to generalize results of Pósa and of Corrádi and Hajnal....
Corradi and Hajnal proved that a graph of order at least 3k and minimum degree at least 2k contains ...
In 1963, Corradi and Hajnal proved that for any positive integer k if a graph contains at least 3k v...
AbstractLet G be a graph of order at least 3k, where k is a positive integer. Justesen (Ann. Disc. M...
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
Bermond and Thomassen conjectured that every digraph with minimum outdegree at least $2k-1$ contains...
Abstract We give a sufficient condition for a simple graph G to have k pairwise edge-disjoint cycles...
AbstractLet G be a graph of order at least 3k, where k is a positive integer. Justesen (Ann. Disc. M...
We prove that every tournament with minimum out-degree at least 2k − 1 contains k disjoint 3-cycles....
AbstractWe show that each finite undirected graph G = (V, E), |V| = n, |E|= m with minimum degree δ(...
AbstractHajnal and Corrádi proved that any simple graph on at least 3k vertices with minimal degree ...
AbstractLet Gn be a class of graphs on n vertices. For an integer c, let ex(Gn,c) be the smallest in...
Abstract. In 1963, Corrádi and Hajnal proved that for all k ≥ 1 and n ≥ 3k, every graph G on n vert...
AbstractWe propose the following conjecture to generalize results of Pósa and of Corrádi and Hajnal....
Corradi and Hajnal proved that a graph of order at least 3k and minimum degree at least 2k contains ...
In 1963, Corradi and Hajnal proved that for any positive integer k if a graph contains at least 3k v...
AbstractLet G be a graph of order at least 3k, where k is a positive integer. Justesen (Ann. Disc. M...
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
Bermond and Thomassen conjectured that every digraph with minimum outdegree at least $2k-1$ contains...
Abstract We give a sufficient condition for a simple graph G to have k pairwise edge-disjoint cycles...
AbstractLet G be a graph of order at least 3k, where k is a positive integer. Justesen (Ann. Disc. M...
We prove that every tournament with minimum out-degree at least 2k − 1 contains k disjoint 3-cycles....
AbstractWe show that each finite undirected graph G = (V, E), |V| = n, |E|= m with minimum degree δ(...
AbstractHajnal and Corrádi proved that any simple graph on at least 3k vertices with minimal degree ...
AbstractLet Gn be a class of graphs on n vertices. For an integer c, let ex(Gn,c) be the smallest in...