On directed versions of the Corrádi-Hajnal corollary

DOI10.1016/j.ejc.2014.05.006zbMath1297.05185arXiv1309.4520OpenAlexW2963141250MaRDI QIDQ404438

Theodore Molla, Andrzej Czygrinow, Henry A. Kierstead

Publication date: 4 September 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)

Related Items

Vertex-disjoint quadrilaterals in multigraphs, Rainbow spanning structures in graph and hypergraph systems, Triangle factors of graphs without large independent sets and of weighted graphs, Rooted prism-minors and disjoint cycles containing a specified edge, An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs, On Directed Versions of the Hajnal–Szemerédi Theorem, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On vertex-disjoint triangles in tripartite graphs and multigraphs, Transitive triangle tilings in oriented graphs, Strengthening Theorems of Dirac and Erdős on Disjoint Cycles, TILING DIRECTED GRAPHS WITH TOURNAMENTS, A degree sequence Hajnal-Szemerédi theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to avoid using the regularity Lemma: Pósa's conjecture revisited
• Triangle packings and 1-factors in oriented graphs
• On the existence of disjoint cycles in a graph
• Transitive triangle tilings in oriented graphs
• An exact minimum degree condition for Hamilton cycles in oriented graphs
• Sufficient Conditions for Circuits in Graphs^†
• On the maximal number of independent circuits in a graph
• Independent directed triangles in a directed graph