Asymptotic Size Ramsey Results for Bipartite Graphs

DOI10.1137/S0895480101384086zbMath1029.05103arXivmath/0101197WikidataQ105584162 ScholiaQ105584162MaRDI QIDQ4443072

Oleg Pikhurko

Publication date: 8 January 2004

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0101197

zbMATH Keywords

mixed integer programmingbipartite graphssize Ramsey numberFarkas lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Mixed integer programming (90C11) Linear programming (90C05) Generalized Ramsey theory (05C55)

Related Items

Remarks on a paper by H. Bielak on size Ramsey numbers ⋮ Size Gallai-Ramsey number ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Further asymptotic size Ramsey results obtained via linear programming ⋮ The size Ramsey number of short subdivisions of bounded degree graphs ⋮ A note on the Size-Ramsey number of long subdivisions of graphs