Stability for vertex cycle covers

MaRDI QIDQ2401441zbMATH OpenFDO

Authors József Balogh, Frank Mousset, J. Skokan

Publication date 8 September 2017

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p56

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

regularitystability theoremDirac's theoremvertex cycle covers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Recommendations

• Covering cycles in sparse graphs
• Coverings of the vertices of a graph by small cycles
• Covering cycles and \(k\)-term degree sums
• Covering a graph with cycles of length at least 4
• Covering a graph with cycles

Cites work

• scientific article; zbMATH DE number 4191728 (Why is no real title available?)
• 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?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
• Analyzing randomized search heuristics: tools from probability theory
• Blow-up lemma
• Covering cycles and \(k\)-term degree sums
• Covering vertices by cycles
• Cycle lengths in graphs with large minimum degree
• Degree Sums and Covering Cycles
• Hamiltonian square-paths
• How to avoid using the regularity Lemma: Pósa's conjecture revisited
• Local colourings and monochromatic partitions in complete bipartite graphs
• On the square of a Hamiltonian cycle in dense graphs
• Partitioning 2-edge-colored graphs by monochromatic paths and cycles
• Proof of a Packing Conjecture of Bollobás
• Proof of the Seymour conjecture for large graphs
• Pósa's conjecture for graphs of order at least 2 × 10⁸
• Some Theorems on Abstract Graphs
• The 3-colored Ramsey number of even cycles
• The Blow-up Lemma
• The Ramsey number for a triple of long even cycles
• The longest cycle of a graph with a large minimal degree
• The longest cycles in a graph G with minimum degree at least \(| G| /k\)
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)

Cited in

(5)

• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Covering cycles in sparse graphs
• The square of a Hamilton cycle in randomly perturbed graphs
• Triangles in randomly perturbed graphs
• Cycle Partitions in Graphs

This page was built for publication: Stability for vertex cycle covers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401441)