Upper and lower bounds for \(F_v(4,4;5)\) (Q612907)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5827380
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper and lower bounds for \(F_v(4,4;5)\) |
scientific article; zbMATH DE number 5827380 |
Statements
Upper and lower bounds for \(F_v(4,4;5)\) (English)
0 references
16 December 2010
0 references
Summary: 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 \(_Fv(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.
0 references
0.8039084672927856
0 references
0.8033650517463684
0 references
0.7800542712211609
0 references
0.7695965766906738
0 references
