Turán theorems for unavoidable patterns

DOI10.1017/S030500412100027XzbMath1484.05102arXiv1907.00964OpenAlexW3190243886MaRDI QIDQ5063194

António Girão, Bhargav P. Narayanan

Publication date: 17 March 2022

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theoryRamsey numbersTurán numbersunavoidable structures

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items

On small balanceable, strongly-balanceable and omnitonal graphs, The balancing number and generalized balancing number of some graph classes

Cites Work

• Unnamed Item
• Unnamed Item
• A new upper bound for diagonal Ramsey numbers
• Unavoidable subgraphs of colored graphs
• Unavoidable patterns
• Finding unavoidable colorful patterns in multicolored graphs
• Dependent random choice
• The Voting Problem
• An upper bound for some ramsey numbers
• Large Unavoidable Subtournaments
• The History of Degenerate (Bipartite) Extremal Graph Problems
• Some remarks on the theory of graphs
• On a problem of K. Zarankiewicz