Geodesic
Upper and lower bounds for \(F_v(4,4;5)\)
The electronic journal of combinatorics, Tome 17 (2010)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/483
Classification : 05C55 
@article{10_37236_483,
     author = {Xiaodong Xu and Haipeng Luo and Zehui Shao},
     title = {Upper and lower bounds for {\(F_v(4,4;5)\)}},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/483},
     zbl = {1204.05060},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/483/}
}
TY  - JOUR
AU  - Xiaodong Xu
AU  - Haipeng Luo
AU  - Zehui Shao
TI  - Upper and lower bounds for \(F_v(4,4;5)\)
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/483/
DO  - 10.37236/483
ID  - 10_37236_483
ER  - 
%0 Journal Article
%A Xiaodong Xu
%A Haipeng Luo
%A Zehui Shao
%T Upper and lower bounds for \(F_v(4,4;5)\)
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/483/
%R 10.37236/483
%F 10_37236_483
Xiaodong Xu; Haipeng Luo; Zehui Shao. Upper and lower bounds for \(F_v(4,4;5)\). The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/483

Cité par Sources :