The Ramsey number for a cycle of length five vs. a complete graph of order six
From MaRDI portal
Publication:4518335
Recommendations
- On the Ramsey numbers of certain graphs of order five versus all connected graphs of order six
- The Ramsey number for two graphs of order 5
- The Ramsey number for a cycle of length six versus a clique of order eight
- Ramsey numbers r(C₅,G) for all graphs G of order six.
- The Cycle-Complete Graph Ramsey Numbers
- All cycle‐complete graph Ramsey numbers r(Cm, K6)
- The Ramsey numbers of fans versus a complete graph of order five
- The Cycle-Complete Graph Ramsey Number r(C5, K7)
- The Ramsey numbers for a cycle of length six or seven versus a clique of order seven
- scientific article; zbMATH DE number 1501956
Cites work
Cited in
(11)- The Ramsey number for a cycle of length six versus a clique of order eight
- Star-critical Ramsey numbers for cycles versus \(K_4\)
- On Ramsey \((mK_2,H)\)-minimal graphs
- An upper bound for the Ramsey number r(C₆,K₉)
- The value of the Ramsey number R₅(C₆)
- The Cycle-Complete Graph Ramsey Number r(C5, K7)
- scientific article; zbMATH DE number 7057473 (Why is no real title available?)
- Five Cycles are Highly Ramsey Infinite
- \(R(C_6,K_5)=21\) and \(R(C_7,K_5)=25\)
- The cycle-complete graph Ramsey number \(r(C_{9}, K_{8})\)
- The Ramsey numbers for a cycle of length six or seven versus a clique of order seven
This page was built for publication: The Ramsey number for a cycle of length five vs. a complete graph of order six
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4518335)