An upper bound for some ramsey numbers
From MaRDI portal
Publication:3809826
DOI10.1002/jgt.3190120406zbMath0661.05043OpenAlexW2030551570MaRDI QIDQ3809826
Publication date: 1988
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190120406
Related Items (16)
Turán theorems for unavoidable patterns ⋮ SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY ⋮ Off-diagonal hypergraph Ramsey numbers ⋮ Diagonal Ramsey via effective quasirandomness ⋮ Exactly \(m\)-coloured complete infinite subgraphs ⋮ The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) ⋮ F$F$‐factors in Quasi‐random Hypergraphs ⋮ Sketchy tweets: ten minute conjectures in graph theory ⋮ Blowup Ramsey numbers ⋮ Unavoidable subgraphs of colored graphs ⋮ A large number of \(m\)-coloured complete infinite subgraphs ⋮ Upper and lower Ramsey bounds in bounded arithmetic ⋮ A new upper bound for diagonal Ramsey numbers ⋮ On the density of subgraphs in a graph with bounded independence number ⋮ The Ramsey number of the clique and the hypercube ⋮ On minimal Ramsey graphs and Ramsey equivalence in multiple colours
This page was built for publication: An upper bound for some ramsey numbers
