Exactly \(m\)-coloured complete infinite subgraphs

DOI10.1016/j.jctb.2014.01.008zbMath1300.05174arXiv1303.2103OpenAlexW2963184052MaRDI QIDQ402596

Bhargav P. Narayanan

Publication date: 28 August 2014

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

Full work available at URL: https://arxiv.org/abs/1303.2103

zbMATH Keywords

Ramsey theoryexactly \(m\)-coloured graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (2)

The multiplication table problem for bipartite graphs ⋮ A large number of \(m\)-coloured complete infinite subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transitive sets in Euclidean Ramsey theory
• A new upper bound for diagonal Ramsey numbers
• The existence of exactly \(m\)-coloured complete subgraphs
• A conjecture concerning Ramsey's theorem
• The distribution of integers with a divisor in a given interval
• An upper bound for some ramsey numbers
• Some new results in multiplicative and additive Ramsey theory
• A Combinatorial Theorem

This page was built for publication: Exactly \(m\)-coloured complete infinite subgraphs