The theta-complete graph Ramsey number R(_n, K₇); n=7; n 14

DOI10.47013/14.3.9MaRDI QIDQ5019145zbMATH OpenFDO

Authors

Publication date 29 December 2021

zbMATH Keywords

complete graphRamsey numbertheta graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Recommendations

• The theta-complete graph Ramsey number \(R(\theta_n,K_5)=4n-3\) for \(n=6\) and \(n\geq 10\).
• The Ramsey number for theta graph versus a clique of order three and four
• Ramsey numbers for theta graphs
• A note on the Ramsey numbers for theta graphs versus the wheel of order \(5\)
• The Ramsey number for two graphs of order 5

Cited in

(5)

• The Ramsey number for theta graph versus a clique of order three and four
• The theta-complete graph Ramsey number \(R(\theta_n,K_5)=4n-3\) for \(n=6\) and \(n\geq 10\).
• scientific article; zbMATH DE number 7340788 (Why is no real title available?)
• Ramsey numbers for theta graphs
• A note on the Ramsey numbers for theta graphs versus the wheel of order \(5\)

This page was built for publication: The theta-complete graph Ramsey number \(R(\theta_n, K_7)\); \(n=7\); \(n\ge 14\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5019145)