Upper and lower bounds for F(4,4;5).v

Xiaodong Xu, Haipeng Luo, Zehui ShaoElectr. J. Comb 2010 · OpenReview

Abstract

In this note we give a computer assisted proof showing that the unique $(5,3)$-Ramsey graph is the unique $K_5$-free graph of order 13 giving $F_v(3,4;5) \leq 13$, then we prove that $17 \leq F_v(2,2,2, 4; 5) \leq F_v(4, 4; 5) \leq 23$. This improves the previous best bounds $16 \leq F_v(4, 4; 5) \leq 25$ provided by Nenov and Kolev.
BibTeX
@article{xu2010upper,
  author = {Xiaodong Xu and Haipeng Luo and Zehui Shao},
  title = {{Upper and lower bounds for F(4,4;5).v}},
  journal = {Electr. J. Comb.},
  year = {2010},
  url = {https://openreview.net/forum?id=E7BewVljdfA},
}

Loading related content...

Figure