Turán-Ramsey Theorems and Kp-Independence Numbers

DOI10.1017/S0963548300001218zbMath0812.05031WikidataQ105741664 ScholiaQ105741664MaRDI QIDQ4314149

Vera T. Sós, Endre Szemerédi, Paul Erdős, Andras Hajnal, Miklós Simmonovits

Publication date: 7 December 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

structure theoremsedge-colouringchromatic number\(K_p\)-independence numberextremal sizeTurán-Ramsey theorems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items

On the Ramsey-Turán number with small \(s\)-independence number, Triangle factors of graphs without large independent sets and of weighted graphs, A few remarks on Ramsey--Turán-type problems, Ramsey-Turán problems with small independence numbers, On the Ramsey-Turán numbers of graphs and hypergraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Two results on Ramsey-Turán theory, On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem, Phase transitions in Ramsey-Turán theory

Cites Work

• More results on Ramsey-Turán type problems
• Asymptotic solution for a new class of forbidden r-graphs
• Some Ramsey-Turán type results for hypergraphs
• On a Ramsey-Turán type problem
• Turán-Ramsey theorems and simple asymptotically extremal structures
• On some applications of graph theory. I
• Extremal problems for directed graphs
• Graph Theory and Probability. II
• Algorithmic Solution of Extremal Digraph Problems
• On chromatic number of graphs and set-systems
• On Some Applications of Graph Theory III