Stability for vertex cycle covers
From MaRDI portal
Publication:2401441
zbMath1369.05116MaRDI QIDQ2401441
Frank Mousset, Jozef Skokan, József Balogh
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
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Vertex degrees (05C07)
Related Items (3)
Triangles in randomly perturbed graphs ⋮ Covering cycles in sparse graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles
- The Ramsey number for a triple of long even cycles
- How to avoid using the regularity Lemma: Pósa's conjecture revisited
- The 3-colored Ramsey number of even cycles
- The longest cycles in a graph G with minimum degree at least \(| G| /k\)
- Proof of the Seymour conjecture for large graphs
- \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
- Blow-up lemma
- Hamiltonian square-paths
- Covering cycles and \(k\)-term degree sums
- The longest cycle of a graph with a large minimal degree
- The Blow-up Lemma
- Covering vertices by cycles
- Degree Sums and Covering Cycles
- Proof of a Packing Conjecture of Bollobás
- On the square of a Hamiltonian cycle in dense graphs
- An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
- Pósa's conjecture for graphs of order at least 2 × 108
- Cycle lengths in graphs with large minimum degree
- Some Theorems on Abstract Graphs
- The tripartite Ramsey number for trees
- Local colourings and monochromatic partitions in complete bipartite graphs
This page was built for publication: Stability for vertex cycle covers
