Unavoidable patterns in locally balanced colourings

DOI10.1017/S0963548323000160MaRDI QIDQ6632777zbMATH OpenFDO

Authors Nina Kamčev, Alp Müyesser

Publication date 5 November 2024

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

Full work available at URL https://doi.org/10.1017/S0963548323000160

zbMATH Keywords

Ramsey theoryunavoidable patterns

Mathematics Subject Classification ID

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

Recommendations

• Finding unavoidable colorful patterns in multicolored graphs
• Unavoidable patterns
• Colored unavoidable patterns and balanceable graphs
• Local colourings and monochromatic partitions in complete bipartite graphs
• Unavoidable subgraphs of colored graphs

Cites work

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

Cited in

(2)

• Ramsey numbers upon vertex deletion
• The evolution of unavoidable bichromatic patterns and extremal cases of balanceability

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632777)