Note on a Ramsey-Turán type problem

DOI10.1007/BF02582954MaRDI QIDQ1073805zbMATH OpenOpenAlexFDO

Authors 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

chromatic numberclique numberindependence number

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3333194
• A few remarks on Ramsey--Turán-type problems
• On a Ramsey-Turán type problem
• scientific article; zbMATH DE number 3765840
• More results on Ramsey-Turán type problems

Cites work

• scientific article; zbMATH DE number 3435529 (Why is no real title available?)
• Graph Theory and Probability
• On a Ramsey-Turán type problem

Cited in

(14)

• scientific article; zbMATH DE number 3765840 (Why is no real title available?)
• A note on highly connected and well-connected Ramsey theory
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• A new lower bound for a Ramsey-type problem
• On two problems in Ramsey-Turán theory
• scientific article; zbMATH DE number 3333194 (Why is no real title available?)
• On a Ramsey-Turán type problem
• Large triangle-free subgraphs in graphs without \(K_ 4\)
• More results on Ramsey-Turán type problems
• A few remarks on Ramsey--Turán-type problems
• On the Ramsey-Turán numbers of graphs and hypergraphs
• The Ramsey-Turán problem for cliques
• Turán-Ramsey problems
• A note on the Erdős-Hajnal hypergraph Ramsey problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073805)