Cycle factors in dense graphs

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.1016/S0012-365X(99)90079-1" rel="nofollow">DOI 10.1016/S0012-365X(99)90079-1</a><a class="pub-badge pub-badge--grey" href="https://zbmath.org/0930.05071" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--grey" href="https://openalex.org/works/W4212784735" rel="nofollow">OpenAlex</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q1292839" rel="nofollow">MaRDI QID Q1292839</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q1292839" rel="nofollow">FDO</a>

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

zbMATH Keywords

cyclefactor

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 878896 (Why is no real title available?)
• 2-factors in dense graphs
• Almost \(H\)-factors in dense graphs
• An algorithmic version of the blow-up lemma
• Blow-up lemma
• Covering a graph with cycles
• Edge disjoint placement of graphs
• Embedding Arbitrary Graphs of Maximum Degree Two
• Lower bounds of tower type for Szemerédi's uniformity lemma
• On circuits in graphs
• On the maximal number of independent circuits in a graph
• Proof of a Packing Conjecture of Bollobás
• Refining the graph density condition for the existence of almost \(K\)-factors
• The Algorithmic Aspects of the Regularity Lemma
• Variants of the Hajnal-Szemer�di Theorem
• \(H\)-factors in dense graphs

Cited in

(5)

• Cycles of Given Size in a Dense Graph
• Almost \(H\)-factors in dense graphs
• scientific article; zbMATH DE number 4191728 (Why is no real title available?)
• Variants of the Hajnal-Szemer�di Theorem
• scientific article; zbMATH DE number 3885948 (Why is no real title available?)

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)