On the Ramsey-Turán density of triangles

DOI10.1007/s00493-021-4340-0OpenAlexW3215893553MaRDI QIDQ2151176

Joanna Polcyn, Tomasz Łuczak, Christian Reiher

Publication date: 30 June 2022

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

triangle-free graphmaximum sizelarge independent sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Andrásfai and Vega graphs in Ramsey–Turán theory, K4$K_4$‐free graphs have sparse halves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• More results on Ramsey-Turán type problems
• On the structure of triangle-free graphs of large minimum degree
• Triangle-free graphs whose independence number equals the degree
• On a Ramsey-Turán type problem
• Another infinite sequence of dense triangle-free graphs
• The Ramsey-Turán problem for cliques
• On a valence problem in extremal graph theory
• Über ein Extremalproblem der Graphentheorie
• On the structure of linear graphs
• Ramsey-Turán theory
• Andrásfai and Vega graphs in Ramsey–Turán theory