On directed versions of the Corrádi-Hajnal corollary
From MaRDI portal
(Redirected from Publication:404438)
Abstract: For , Corr'adi and Hajnal proved that every graph on vertices with minimum degree has a -factor, i.e., a partitioning of the vertex set so that each part induces the 3-cycle . Wang proved that every directed graph on vertices with minimum total degree has a -factor, where is the directed 3-cycle. The degree bound in Wang's result is tight. However, our main result implies that for all integers and with , every directed graph on vertices with minimum total degree has a factor consisting of copies of and copies of , where is the transitive tournament on three vertices. In particular, using , there is a -factor of , and using , it is possible to obtain a -factor of by reversing just one edge of . All these results are phrased and proved more generally in terms of undirected multigraphs. We conjecture that every directed graph on vertices with minimum semidegree has a -factor, and prove that this is asymptotically correct.
Recommendations
Cites work
- scientific article; zbMATH DE number 4191728 (Why is no real title available?)
- scientific article; zbMATH DE number 3149611 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- An exact minimum degree condition for Hamilton cycles in oriented graphs
- How to avoid using the regularity Lemma: Pósa's conjecture revisited
- Independent directed triangles in a directed graph
- On the existence of disjoint cycles in a graph
- On the maximal number of independent circuits in a graph
- Sufficient Conditions for Circuits in Graphs†
- Transitive triangle tilings in oriented graphs
- Triangle packings and 1-factors in oriented graphs
Cited in
(13)- Rooted prism-minors and disjoint cycles containing a specified edge
- Triangle factors of graphs without large independent sets and of weighted graphs
- Rainbow spanning structures in graph and hypergraph systems
- Strengthening Theorems of Dirac and Erdős on Disjoint Cycles
- A degree sequence Hajnal-Szemerédi theorem
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Tiling directed graphs with tournaments
- An extension of the Hajnal-Szemerédi theorem to directed graphs
- On directed versions of the Hajnal-Szemerédi theorem
- Transversal Ck-factors in subgraphs of the balanced blow-up of Ck
- On vertex-disjoint triangles in tripartite graphs and multigraphs
- Transitive triangle tilings in oriented graphs
- Vertex-disjoint quadrilaterals in multigraphs
This page was built for publication: On directed versions of the Corrádi-Hajnal corollary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404438)