A Sharp Dirac–Erdős Type Bound for Large Graphs

DOI10.1017/S0963548318000020zbMath1390.05108arXiv1707.03892MaRDI QIDQ4635509

Andrew McConvey, Henry A. Kierstead, Alexandr V. Kostochka

Publication date: 23 April 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.03892

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• On the Corrádi-Hajnal theorem and a question of Dirac
• A refinement of a result of Corrádi and Hajnal
• On the maximum number of independent cycles in a graph
• On the existence of disjoint cycles in a graph
• Sharpening an ore-type version of the Corrádi-Hajnal theorem
• Minimum degree conditions for vertex-disjoint even cycles in large graphs
• An Ore-type theorem on equitable coloring
• Strengthening Theorems of Dirac and Erdős on Disjoint Cycles
• Some Results Concerning the Structure of Graphs
• On the maximal number of independent circuits in a graph
• On the maximal number of independent circuits in a graph
• Unnamed Item
• Unnamed Item

This page was built for publication: A Sharp Dirac–Erdős Type Bound for Large Graphs