Minimum degree conditions for vertex-disjoint even cycles in large graphs

DOI10.1016/j.aam.2013.12.001zbMath1284.05209OpenAlexW2034156419MaRDI QIDQ2439893

Shinya Fujita, Shuya Chiba, Ken-ichi Kawarabayashi, Tadashi Sakuma

Publication date: 25 March 2014

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2013.12.001

zbMATH Keywords

minimum degreevertex-disjoint cyclestheta grapheven cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (11)

Sharp minimum degree conditions for the existence of disjoint theta graphs ⋮ Cycles of Given Size in a Dense Graph ⋮ Negative (and positive) circles in signed graphs: a problem collection ⋮ On the Corrádi-Hajnal theorem and a question of Dirac ⋮ Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree ⋮ Lichiardopol's conjecture on disjoint cycles in tournaments ⋮ Perfect matching in bipartite hypergraphs subject to a demand graph ⋮ Rooted prism-minors and disjoint cycles containing a specified edge ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ A Sharp Dirac–Erdős Type Bound for Large Graphs ⋮ Strengthening Theorems of Dirac and Erdős on Disjoint Cycles

Cites Work

• Unnamed Item
• Unnamed Item
• On a sharp degree sum condition for disjoint chorded cycles in graphs
• Proof of the Erdős-Faudree conjecture on quadrilaterals
• Disjoint chorded cycles in graphs
• Graph minors. V. Excluding a planar graph
• \(H\)-factors in dense graphs
• On the number of independent chorded cycles in a graph
• On the presence of disjoint subgraphs of a specified type
• K₄⁻‐factor in a graph
• Vertex-disjoint copies of K₄^-
• Approximation algorithms and hardness results for cycle packing problems
• On the maximal number of independent circuits in a graph
• Proof of the Alon-Yuster conjecture

This page was built for publication: Minimum degree conditions for vertex-disjoint even cycles in large graphs