A generalization of Ramsey theory for graphs

DOI10.1016/0012-365X(78)90084-5zbMath0374.05040MaRDI QIDQ1245237

K. Appert

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

Monochromatic tree covers and Ramsey numbers for set-coloured graphs, The (t−1) $(t-1)$‐chromatic Ramsey number for paths, On a generalization of Ramsey theory, Complementary Ramsey Numbers, Coverings by few monochromatic pieces: a transition between two Ramsey problems, Unnamed Item, A generalization of Ramsey theory for linear forests, Unnamed Item, Unnamed Item

Cites Work

• Unnamed Item
• Some graph theoretic results associated with Ramsey's theorem
• Generalized Ramsey theory for graphs
• Combinatorial Relations and Chromatic Graphs