Further asymptotic size Ramsey results obtained via linear programming

DOI10.1016/S0012-365X(03)00237-1MaRDI QIDQ1417577zbMATH OpenFDO

Authors Oleg Pikhurko

Publication date 5 January 2004

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(03)00237-1

zbMATH Keywords

complete bipartite graphsSize Ramsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Linear programming (90C05)

Recommendations

• Asymptotic Size Ramsey Results for Bipartite Graphs
• The size Ramsey number of a complete bipartite graph
• Size Ramsey numbers of stars versus 3-chromatic graphs
• Size ramsey numbers of stars versus 4‐chromatic graphs
• scientific article; zbMATH DE number 1229599

Cites work

• Asymptotic Size Ramsey Results for Bipartite Graphs
• Remarks on the size Ramsey number of graphs
• Size Ramsey numbers involving stars

Cited in

(2)

• Remarks on a paper by H. Bielak on size Ramsey numbers
• Refuting conjectures in extremal combinatorics via linear programming

This page was built for publication: Further asymptotic size Ramsey results obtained via linear programming

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