What is Ramsey-equivalent to a clique?
From MaRDI portal
Publication:462928
DOI10.1016/J.JCTB.2014.06.003zbMath1301.05226arXiv1312.0299OpenAlexW2028276181MaRDI QIDQ462928
Andrey Grinshpun, Tibor Szabó, Yury Person, Anita Liebenau, Jacob Fox
Publication date: 22 October 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.0299
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items (11)
On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles ⋮ Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs ⋮ Ramsey equivalence of \(K_n\) and \(K_n+K_{n-1}\) ⋮ Minimal Ramsey Graphs with Many Vertices of Small Degree ⋮ Chromatic number is Ramsey distinguishing ⋮ Ramsey Equivalence for Asymmetric Pairs of Graphs ⋮ Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs ⋮ On minimal Ramsey graphs and Ramsey equivalence in multiple colours ⋮ Mini-workshop: Positional games. Abstracts from the mini-workshop held September 30 -- October 6, 2018 ⋮ Minimal ordered Ramsey graphs ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth
Cites Work
- On the minimum degree of minimal Ramsey graphs for multiple colours
- A new upper bound for diagonal Ramsey numbers
- The Ramsey property for graphs with forbidden complete subgraphs
- On the minimum degree of minimal Ramsey graphs
- The minimum degree of Ramsey-minimal graphs
- On chromatic number of graphs and set-systems
- Some remarks on the theory of graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: What is Ramsey-equivalent to a clique?
