The existence of exactly \(m\)-coloured complete subgraphs

DOI10.1006/jctb.1998.1855zbMath0960.05102OpenAlexW2062391526MaRDI QIDQ1306417

Peter Weidl, Alan M. Stacey

Publication date: 17 May 2001

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1998.1855

zbMATH Keywords

colouringRamsey's theorem

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (4)

Approximations to m‐Colored Complete Infinite Hypergraphs ⋮ Exactly \(m\)-coloured complete infinite subgraphs ⋮ A large number of \(m\)-coloured complete infinite subgraphs ⋮ A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs

Cites Work

• A conjecture concerning Ramsey's theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The existence of exactly \(m\)-coloured complete subgraphs