More results on Ramsey-Turán type problems

DOI10.1007/BF02579342zbMath0526.05031OpenAlexW2086312639MaRDI QIDQ594896

Vera T. Sós, Andras Hajnal

Publication date: 1983

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579342

zbMATH Keywords

arboricitylargest independent setsequence of graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Related Items (35)

Turán-Ramsey theorems and simple asymptotically extremal structures ⋮ Triangle-Tilings in Graphs Without Large Independent Sets ⋮ On the Ramsey-Turán density of triangles ⋮ SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY ⋮ On the Ramsey-Turán number with small \(s\)-independence number ⋮ Some Ramsey-Turán type results for hypergraphs ⋮ Locally Ramsey properties of graphs ⋮ Turán-Ramsey problems ⋮ The Ramsey-Turán problem for cliques ⋮ Erdős-Hajnal conjecture for graphs with bounded VC-dimension ⋮ Turán-Ramsey Theorems and K_p-Independence Numbers ⋮ Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ Andrásfai and Vega graphs in Ramsey–Turán theory ⋮ Triangle factors of graphs without large independent sets and of weighted graphs ⋮ On Two Problems in Ramsey--Turán Theory ⋮ K4$K_4$‐free graphs have sparse halves ⋮ A few remarks on Ramsey--Turán-type problems ⋮ A Ramsey–Turán theory for tilings in graphs ⋮ Ramsey-Turán problems with small independence numbers ⋮ On the Ramsey-Turán numbers of graphs and hypergraphs ⋮ The bandwidth theorem for locally dense graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Two Conjectures in Ramsey--Turán Theory ⋮ Ramsey-Turán numbers for semi-algebraic graphs ⋮ Two results on Ramsey-Turán theory ⋮ A multipartite Ramsey number for odd cycles ⋮ The critical window for the classical Ramsey-Turán problem ⋮ \(K_r\)-factors in graphs with low independence number ⋮ On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem ⋮ The 3-colored Ramsey number of even cycles ⋮ Edge-colored complete graphs with precisely colored subgraphs ⋮ A hierarchy of randomness for graphs ⋮ A unified approach to hypergraph stability ⋮ How to make a graph bipartite ⋮ Phase transitions in Ramsey-Turán theory

Cites Work

• Unnamed Item
• Unnamed Item
• On a Ramsey-Turán type problem
• Graph Theory and Probability
• On sets of integers containing k elements in arithmetic progression
• Note on a Property of Measurable Sets
• On the structure of linear graphs

This page was built for publication: More results on Ramsey-Turán type problems