Non-bipartite pairs of 3-connected graphs are highly Ramsey-infinite

DOI10.1016/j.ejc.2013.06.001zbMath1284.05166OpenAlexW2066288452MaRDI QIDQ2441625

Mark H. Siggers

Publication date: 25 March 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2013.06.001

zbMATH Keywords

determinerssendersRamsey-infinite graphs

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Connectivity (05C40)

Related Items (1)

On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the use of senders in generalized Ramsey theory for graphs
• Ramsey-minimal graphs for star-forests
• Ramsey-minimal graphs for forests
• Constraints, MMSNP and expander relational structures
• On highly ramsey infinite graphs
• On Ramsey Minimal Graphs
• Threshold Functions for Ramsey Properties
• Five Cycles are Highly Ramsey Infinite
• On Ramsey minimal graphs

This page was built for publication: Non-bipartite pairs of 3-connected graphs are highly Ramsey-infinite