Cycle-complete graph Ramsey numbers r(C₄,K₉) ,r(C₅,K₈) 33

MaRDI QIDQ3561264zbMATH OpenFDO

Authors M. M. M. Jaradat, B. M. N. Alzaleq

Publication date 25 May 2010

zbMATH Keywords

complete graphcycleindependent setSmarandache-Ramsey number

Mathematics Subject Classification ID

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

Recommendations

• The cycle-complete graph Ramsey number \(r(C_6,K_8)\leq 38\)
• On cycle—Complete graph ramsey numbers
• The Cycle-Complete Graph Ramsey Number r(C₅, K₇)
• The cycle-complete graph Ramsey number \(r(C_{9}, K_{8})\)
• The Cycle-Complete Graph Ramsey Numbers

Cited in

(2)

• Semidefinite programming and Ramsey numbers
• Bounds on small Ramsey numbers by semidefinite programming

This page was built for publication: Cycle-complete graph Ramsey numbers \(r(C_4,K_9)\) \(,r(C_5,K_8)\leq 33\)

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