Turán-Ramsey theorems and simple asymptotically extremal structures
From MaRDI portal
Publication:2367441
DOI10.1007/BF01202788zbMath0774.05050OpenAlexW2068922840WikidataQ101119739 ScholiaQ101119739MaRDI QIDQ2367441
Endre Szemerédi, Paul Erdős, Vera T. Sós, Miklós Simmonovits, Andras Hajnal
Publication date: 16 August 1993
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01202788
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Generalized Ramsey theory (05C55)
Related Items
Turán-Ramsey problems, Turán-Ramsey Theorems and Kp-Independence Numbers, A few remarks on Ramsey--Turán-type problems, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Two Conjectures in Ramsey--Turán Theory, Two results on Ramsey-Turán theory, The critical window for the classical Ramsey-Turán problem, A hierarchy of randomness for graphs, Phase transitions in Ramsey-Turán theory
Cites Work
- Unnamed Item
- Unnamed Item
- More results on Ramsey-Turán type problems
- Some Ramsey-Turán type results for hypergraphs
- On a Ramsey-Turán type problem
- On some applications of graph theory. I
- Extremal problems for directed graphs
- Algorithmic Solution of Extremal Digraph Problems
- Maxima for Graphs and a New Proof of a Theorem of Turán
- The Construction of Certain Graphs
- On Some Applications of Graph Theory III
- On the theory of graphs
- On the structure of linear graphs