Finding unavoidable colorful patterns in multicolored graphs

DOI10.37236/8184zbMath1450.05093arXiv1807.02780OpenAlexW3090483594MaRDI QIDQ2205113

Alp Müyesser, Ander Lamaison, Matthew Bowen

Publication date: 20 October 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey-type problem

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (3)

Turán theorems for unavoidable patterns ⋮ Turán‐ and Ramsey‐type results for unavoidable subgraphs ⋮ Unavoidable chromatic patterns in 2‐colorings of the complete graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unavoidable subgraphs of colored graphs
• Unavoidable patterns
• On extremal problems of graphs and generalized graphs
• On a Ramsey type theorem
• Dependent random choice
• Recent developments in graph Ramsey theory
• Anticoncentration for subgraph statistics
• On a problem of K. Zarankiewicz
• TWO MEASURE PROPERTIES OF CARTESIAN PRODUCT SETS

This page was built for publication: Finding unavoidable colorful patterns in multicolored graphs