Sharpening an ore-type version of the Corrádi-Hajnal theorem
From MaRDI portal
Publication:1688267
DOI10.1007/s12188-016-0168-8zbMath1462.05143OpenAlexW2565774297MaRDI QIDQ1688267
Alexandr V. Kostochka, Elyse Yeager, Henry A. Kierstead, Theodore Molla
Publication date: 5 January 2018
Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12188-016-0168-8
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Vertex degrees (05C07)
Related Items (6)
A refinement of theorems on vertex-disjoint chorded cycles ⋮ On the Corrádi-Hajnal theorem and a question of Dirac ⋮ Rooted prism-minors and disjoint cycles containing a specified edge ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A Sharp Dirac–Erdős Type Bound for Large Graphs ⋮ Strengthening Theorems of Dirac and Erdős on Disjoint Cycles
Cites Work
- On the Corrádi-Hajnal theorem and a question of Dirac
- Graphs with chromatic number close to maximum degree
- A refinement of a result of Corrádi and Hajnal
- \(\Delta \)-critical graphs with small high vertex cliques
- Ore-type versions of Brooks' theorem
- Spanning subgraphs of random graphs
- On the maximum number of independent cycles in a graph
- On the existence of disjoint cycles in a graph
- Equitable coloring and the maximum degree
- The \((2k-1)\)-connected multigraphs with at most \(k-1\) disjoint cycles
- On equitable coloring of bipartite graphs
- \(H\)-factors in dense graphs
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
- An Ore-type theorem on equitable coloring
- Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
- On the maximal number of independent circuits in a graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sharpening an ore-type version of the Corrádi-Hajnal theorem
