Classes of graphs that exclude a tree and a clique and are not vertex Ramsey

DOI10.1007/BF01271268MaRDI QIDQ1375696zbMATH OpenOpenAlexFDO

Authors Yingxian Zhu, H. A. Kierstead

Publication date 11 January 1998

Published in Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey graphs

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Review text

It is shown that if \(k\) is large enough depending on \(r\), \(q\) then the class \(\text{Forb}\bigl(T(k,r),K_q\bigr)\) fails to have the Ramsey property. Here \(K_q\) is the clique on \(q\) vertices and \(T(k,r)\) is the tree with radius \(r\) and with degrees \(k+1\) (except for the leaves).

Recommendations

• Classes of Graphs that Are Not Vertex Ramsey
• The Ramsey Property for Families of Graphs Which Exclude a Given Graph
• Ramsey families which exclude a graph

Cites work

• Applications of hypergraph coloring to coloring graphs not inducing certain trees
• Classes of Graphs that Are Not Vertex Ramsey
• scientific article; zbMATH DE number 524137 (Why is no real title available?)
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• Induced subtrees in graphs of large chromatic number
• On the Ramsey Property of Families of Graphs
• On-Line Coloring and Recursive Graph Theory
• Radius two trees specify χ‐bounded classes
• Ramsey families which exclude a graph
• The Ramsey Property for Families of Graphs Which Exclude a Given Graph

Cited in

(3)

• Excluding a countable clique
• On Ramsey properties of classes with forbidden trees
• Classes of Graphs that Are Not Vertex Ramsey

This page was built for publication: Classes of graphs that exclude a tree and a clique and are not vertex Ramsey

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