A generalization of Ramsey theory for graphs

DOI10.1016/0012-365X(78)90084-5zbMATH Open0374.05040MaRDI QIDQ1245237FDOQ1245237

Authors: K. Appert 

Publication date: 1978

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Combinatorial Relations and Chromatic Graphs
• Some graph theoretic results associated with Ramsey's theorem
• Title not available (Why is that?)
• Generalized Ramsey theory for graphs

Cited In (10)

• Subgraphs of Gallai-colored complete graphs spanned by edges using at most two colors
• Title not available (Why is that?)
• On a generalization of Ramsey theory
• Large sets of \(t\)-designs and a Ramsey-type problem
• Complementary Ramsey numbers and Ramsey graphs
• A generalization of Ramsey theory for linear forests
• The (t−1) $(t-1)$‐chromatic Ramsey number for paths
• The power of many colours
• Coverings by few monochromatic pieces: a transition between two Ramsey problems
• Monochromatic tree covers and Ramsey numbers for set-coloured graphs

This page was built for publication: A generalization of Ramsey theory for graphs

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