A Note on Ramsey's Theorem

DOI10.4153/CMB-1972-002-5zbMATH Open0242.05123MaRDI QIDQ5652707FDOQ5652707

H. L. Abbott

Publication date: 1972

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cited In (8)

• Lower bounds for some Ramsey numbers
• Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension
• Approximating hyper-rectangles: Learning and pseudorandom sets
• Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers
• Lower bounds for some Ramsey numbers
• Large cliques and independent sets all over the place
• Partitions of sets of matrices
• Constructions of permutation arrays for certain scheduling cost measures

This page was built for publication: A Note on Ramsey's Theorem

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