Ramsey equivalence of \(K_n\) and \(K_n+K_{n-1}\)
From MaRDI portal
Publication:1658778
zbMath1393.05185arXiv1508.03866MaRDI QIDQ1658778
Anita Liebenau, Thomas F. Bloom
Publication date: 15 August 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.03866
Related Items (5)
Chromatic number is Ramsey distinguishing ⋮ Ramsey Equivalence for Asymmetric Pairs of Graphs ⋮ 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
Cites Work
- Unnamed Item
- What is Ramsey-equivalent to a clique?
- Ramsey-minimal graphs for forests
- The Ramsey property for graphs with forbidden complete subgraphs
- On the minimum degree of minimal Ramsey graphs
- More Constructive Lower Bounds on Classical Ramsey Numbers
- The structure of critical Ramsey graphs
- Conditions on Ramsey Nonequivalence
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
This page was built for publication: Ramsey equivalence of \(K_n\) and \(K_n+K_{n-1}\)
