Unavoidable patterns in locally balanced colourings

DOI10.1017/s0963548323000160MaRDI QIDQ6632777

Nina Kamčev, Alp Müyesser

Publication date: 5 November 2024

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

Ramsey theoryunavoidable patterns

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Unavoidable subgraphs of colored graphs
• Unavoidable patterns
• Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko
• Finding unavoidable colorful patterns in multicolored graphs
• Extremal and Ramsey results on graph blowups
• A combinatorial problem in geometry.
• Graph Theory
• Graph removal lemmas
• Dependent random choice
• Turán theorems for unavoidable patterns
• Graphs with many r -cliques have large complete r -partite subgraphs
• On a problem of K. Zarankiewicz
• Induced Ramsey-type theorems
• Turán‐ and Ramsey‐type results for unavoidable subgraphs
• Unavoidable chromatic patterns in 2‐colorings of the complete graph
• Two Ramsey problems in blowups of graphs

Related Items (1)

Ramsey numbers upon vertex deletion

This page was built for publication: Unavoidable patterns in locally balanced colourings