On highly ramsey infinite graphs
From MaRDI portal
Publication:3605143
DOI10.1002/jgt.20324zbMath1159.05038OpenAlexW4234861332MaRDI QIDQ3605143
Publication date: 20 February 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20324
Related Items (6)
On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles ⋮ Minimal Ramsey Graphs with Many Vertices of Small Degree ⋮ On Ramsey (\(K_{1,m},\mathcal{G}\))-minimal graphs ⋮ Non-bipartite pairs of 3-connected graphs are highly Ramsey-infinite ⋮ Dichotomy for bounded degree \(H\)-colouring ⋮ A combinatorial constraint satisfaction problem dichotomy classification conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the use of senders in generalized Ramsey theory for graphs
- On graphs with Ramsey-infinite blocks
- Ramsey-minimal graphs for star-forests
- Ramsey-minimal graphs for forests
- On colorings of graphs without short cycles
- On Ramsey Minimal Graphs
- Threshold Functions for Ramsey Properties
- On Ramsey minimal graphs
This page was built for publication: On highly ramsey infinite graphs
