A note on constructive methods for ramsey numbers
From MaRDI portal
Publication:3900105
DOI10.1002/jgt.3190050109zbMath0453.05047OpenAlexW1990285340MaRDI QIDQ3900105
Publication date: 1981
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190050109
Related Items (9)
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 ⋮ On the coverings of graphs ⋮ Unnamed Item ⋮ Quasi-random subsets of \(\mathbb{Z}_ n\) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs ⋮ On families in finite lattices
Cites Work
This page was built for publication: A note on constructive methods for ramsey numbers
