A few remarks on Ramsey--Turán-type problems
From MaRDI portal
Publication:1405104
DOI10.1016/S0095-8956(02)00038-2zbMath1029.05104MaRDI QIDQ1405104
Publication date: 25 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items (22)
On explicit constructions of designs ⋮ A Folkman Linear Family ⋮ On the Ramsey-Turán number with small \(s\)-independence number ⋮ Two extensions of Ramsey's theorem ⋮ The intersection spectrum of 3‐chromatic intersecting hypergraphs ⋮ Ramsey-Turán problems with small independence numbers ⋮ On the Ramsey-Turán numbers of graphs and hypergraphs ⋮ Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Two Conjectures in Ramsey--Turán Theory ⋮ Two results on Ramsey-Turán theory ⋮ Hypergraph Packing and Sparse Bipartite Ramsey Numbers ⋮ On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs ⋮ The critical window for the classical Ramsey-Turán problem ⋮ Unavoidable patterns ⋮ \(K_r\)-factors in graphs with low independence number ⋮ When is an Almost MonochromaticK4Guaranteed? ⋮ Dependent random choice ⋮ Ramsey numbers of sparse hypergraphs ⋮ Two remarks on the Burr-Erdős conjecture ⋮ A hierarchy of randomness for graphs ⋮ Phase transitions in Ramsey-Turán theory
Cites Work
- Unnamed Item
- More results on Ramsey-Turán type problems
- A note on Ramsey numbers
- On a Ramsey-Turán type problem
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- Turán-Ramsey theorems and simple asymptotically extremal structures
- On graphs with small Ramsey numbers*
- Graph Theory and Probability
- Turán-Ramsey Theorems and Kp-Independence Numbers
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Ramsey-Turán theory
This page was built for publication: A few remarks on Ramsey--Turán-type problems
