Note on a Ramsey-Turán type problem

DOI10.1007/BF02582954zbMath0589.05043OpenAlexW1975359506MaRDI QIDQ1073805

Vojtěch Rödl

Publication date: 1985

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

independence numberchromatic numberclique number

Mathematics Subject Classification ID

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

Related Items (2)

On the Ramsey-Turán numbers of graphs and hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems

Cites Work

• On a Ramsey-Turán type problem
• Graph Theory and Probability
• Unnamed Item

This page was built for publication: Note on a Ramsey-Turán type problem