Ramsey-Turán theory
From MaRDI portal
Publication:5931457
DOI10.1016/S0012-365X(00)00214-4zbMath0965.05072OpenAlexW2088592896MaRDI QIDQ5931457
Vera T. Sós, Miklós Simmonovits
Publication date: 23 July 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00214-4
hypergraphBollobás-Erdős graphcomplete graphsextremal problemsisoperimetric problemsRamsey-Turán theoremsSzemerédi lemma
Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (34)
A problem of Erdős and Sós on 3-graphs ⋮ Construction of a family of graphs with a small induced proper subgraph with minimum degree 3 ⋮ On the Ramsey-Turán density of triangles ⋮ On the chromatic number and independence number of hypergraph products ⋮ On the Ramsey-Turán number with small \(s\)-independence number ⋮ A new class of Ramsey-Turán problems ⋮ The Ramsey-Turán problem for cliques ⋮ Erdős-Hajnal conjecture for graphs with bounded VC-dimension ⋮ Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ Andrásfai and Vega graphs in Ramsey–Turán theory ⋮ Clique-factors in graphs with sublinear -independence number ⋮ Triangle factors of graphs without large independent sets and of weighted graphs ⋮ On Two Problems in Ramsey--Turán Theory ⋮ Refinement on Spectral Turán’s Theorem ⋮ A few remarks on Ramsey--Turán-type problems ⋮ A Ramsey–Turán theory for tilings in graphs ⋮ Some Ramsey-Turán type problems and related questions ⋮ Tree decompositions of graphs without large bipartite holes ⋮ 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 ⋮ Structure Along Arithmetic Patterns in Sequences of Vectors ⋮ Induced Turán Numbers ⋮ The critical window for the classical Ramsey-Turán problem ⋮ \(K_r\)-factors in graphs with low independence number ⋮ On the maximum number of cliques in a graph ⋮ A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems ⋮ On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem ⋮ Ramsey numbers involving an odd cycle and large complete graphs in three colors ⋮ A hierarchy of randomness for graphs ⋮ Phase transitions in Ramsey-Turán theory
This page was built for publication: Ramsey-Turán theory
