Lower bounds for some Ramsey numbers

DOI10.1016/0012-365X(72)90009-XzbMath0242.05124OpenAlexW2010905814MaRDI QIDQ5921514

H. L. Abbott

Publication date: 1972

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

Full work available at URL: https://doi.org/10.1016/0012-365x(72)90009-x

Mathematics Subject Classification ID

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

Related Items (10)

An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ Unnamed Item ⋮ Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza ⋮ On Harrington's partition relation ⋮ Some properties of Ramsey numbers ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs ⋮ Connectedness strength of two vertices in an uncertain graph

Cites Work

• Unnamed Item
• Unnamed Item
• Sum-free sets of integers
• A problem of Schur and its generalizations
• A Note on Ramsey's Theorem
• Some remarks on the theory of graphs
• Combinatorial Relations and Chromatic Graphs

This page was built for publication: Lower bounds for some Ramsey numbers