Decomposition of bounded degree graphs into \(C_4\)-free subgraphs

DOI10.1016/j.ejc.2014.09.009zbMath1302.05141arXiv1408.1983OpenAlexW2143482081MaRDI QIDQ472402

Ross J. Kang, Guillem Perarnau

Publication date: 19 November 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.1983

zbMATH Keywords

iterated random colouring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items

Degree Ramsey numbers for even cycles, Multicolor list Ramsey numbers grow exponentially, Degree bipartite Ramsey numbers

Cites Work

• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• Degree Ramsey numbers for cycles and blowups of trees
• On multicolor Ramsey numbers for complete bipartite graphs
• Generalised Ramsey numbers for small graphs
• Multi-color Ramsey numbers of even cycles
• A note on the Turán function of even cycles
• Degree Ramsey Numbers of Graphs
• Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree
• The History of Degenerate (Bipartite) Extremal Graph Problems
• Decomposition of Finite Graphs Into Forests
• Graph colouring and the probabilistic method