Cycle factors in dense graphs
From MaRDI portal
Publication:1292839
DOI10.1016/S0012-365X(99)90079-1zbMATH Open0930.05071OpenAlexW4212784735MaRDI QIDQ1292839FDOQ1292839
Authors: Eldar Fischer 
Publication date: 30 January 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90079-1
Recommendations
- Cycles in dense digraphs
- Cycles of Given Size in a Dense Graph
- Dense graphs with cycle neighborhoods
- Path and cycle decompositions of dense graphs
- Cycles in graphs with small density
- Cycle lengths in sparse graphs
- Decomposing hypergraphs into cycle factors
- Cycles with a chord in dense graphs
- Cycles in graphs with large independence ratio
- Factors in graphs with odd-cycle property
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Almost \(H\)-factors in dense graphs
- \(H\)-factors in dense graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the maximal number of independent circuits in a graph
- Title not available (Why is that?)
- Blow-up lemma
- Proof of a Packing Conjecture of Bollobás
- Edge disjoint placement of graphs
- On circuits in graphs
- Embedding Arbitrary Graphs of Maximum Degree Two
- Lower bounds of tower type for Szemerédi's uniformity lemma
- An algorithmic version of the blow-up lemma
- 2-factors in dense graphs
- Variants of the Hajnal-Szemer�di Theorem
- Refining the graph density condition for the existence of almost \(K\)-factors
- The Algorithmic Aspects of the Regularity Lemma
- Covering a graph with cycles
Cited In (5)
This page was built for publication: Cycle factors in dense graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292839)
