The Ramsey number for theta graph versus a clique of order three and four

DOI10.7151/DMGT.1730zbMATH Open1290.05109OpenAlexW2048053315MaRDI QIDQ2450122FDOQ2450122

Authors: Yanyan Li 

Publication date: 16 May 2014

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1730

Recommendations

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

zbMATH Keywords

independent setcomplete graphRamsey numbertheta graph

Mathematics Subject Classification ID

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

Cites Work

• All triangle-graph ramsey numbers for connected graphs of order six
• Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
• Ramsey numbers involving cycles
• Ramsey numbers for theta graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Non-proper edge-colouring of graphs and hereditary graph properties
• The theta-complete graph Ramsey number \(R(\theta_n,K_5)=4n-3\) for \(n=6\) and \(n\geq 10\).
• The Ramsey number for two graphs of order 5
• The theta-complete graph Ramsey number \(R(\theta_n, K_7)\); \(n=7\); \(n\ge 14\)
• 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 Ramsey number for theta graph versus a clique of order three and four

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