Turán‐ and Ramsey‐type results for unavoidable subgraphs

DOI10.1002/jgt.22842zbMath1522.05298arXiv2004.07147OpenAlexW4281484354MaRDI QIDQ6046642

Michael Tait, Alp Müyesser

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey numbersTurán-type problemunavoidable graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• The Ramsey number of a graph with bounded maximum degree
• Unavoidable subgraphs of colored graphs
• Unavoidable patterns
• Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\)
• Non-monochromatic triangles in a 2-edge-coloured graph
• Finding unavoidable colorful patterns in multicolored graphs
• On the balanceability of some graph classes
• Recent developments in graph Ramsey theory
• Turan's Graph Theorem
• Unavoidable chromatic patterns in 2‐colorings of the complete graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Turán‐ and Ramsey‐type results for unavoidable subgraphs