Stability for vertex cycle covers

zbMATH Open1369.05116MaRDI QIDQ2401441FDOQ2401441

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

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

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

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)

Cites Work

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

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)