The Ramsey number of a graph with bounded maximum degree

1983/06/01 by C Chvatál, V. Rödl, V Rödl +4 · 6 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topology and Set Theory #Bounded function #Combinatorics #Conjecture #Degree (music) #Discrete mathematics #Graph #Graph factorization #Graph power #Limits and Structures in Graph Theory #Line graph #Mathematics #Physics #Ramsey's theorem

paper · doi:10.1016/0095-8956(83)90037-0

crossref issued 1983/06/01 · crossref published 1983/06/01 · crossref published-print 1983/06/01 · openalex publication_date 1983/06/01 · crossref created 2005/02/09 · crossref deposited 2019/01/29 · openalex created_date 2025/10/10 · crossref indexed 2026/07/13 · openalex updated_date 2026/07/23

Cited by

• Ramsey linear families and generalized subdivided graphs
• Ramsey numbers for sparse graphs
• Subdivided graphs have linear ramsey numbers
• Two remarks on the Burr–Erdős conjecture
• Ramsey Number of a Connected Triangle Matching
• Burr–Erdős conjecture [wikipedia]