Geodesic
All Ramsey numbers \(r(K_ 3,G)\) for connected graphs of order 9
The electronic journal of combinatorics, Tome 5 (1998)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We determine the Ramsey numbers $r(K_3,G)$ for all $261080$ connected graphs of order $9$ and further Ramsey numbers of this type for some graphs of order up to $12$. Almost all of them were determined by computer programs which are based on a program for generating maximal triangle-free graphs.
DOI : 10.37236/1345
Classification : 05C55
Mots-clés : Ramsey numbers, connected graphs 
@article{10_37236_1345,
     author = {Stephan Brandt and Gunnar Brinkmann and Thomas Harmuth},
     title = {All {Ramsey} numbers {\(r(K_} {3,G)\)} for connected graphs of order 9},
     journal = {The electronic journal of combinatorics},
     year = {1998},
     volume = {5},
     doi = {10.37236/1345},
     zbl = {0885.05088},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1345/}
}
TY  - JOUR
AU  - Stephan Brandt
AU  - Gunnar Brinkmann
AU  - Thomas Harmuth
TI  - All Ramsey numbers \(r(K_ 3,G)\) for connected graphs of order 9
JO  - The electronic journal of combinatorics
PY  - 1998
VL  - 5
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1345/
DO  - 10.37236/1345
ID  - 10_37236_1345
ER  - 
%0 Journal Article
%A Stephan Brandt
%A Gunnar Brinkmann
%A Thomas Harmuth
%T All Ramsey numbers \(r(K_ 3,G)\) for connected graphs of order 9
%J The electronic journal of combinatorics
%D 1998
%V 5
%U http://geodesic.mathdoc.fr/articles/10.37236/1345/
%R 10.37236/1345
%F 10_37236_1345
Stephan Brandt; Gunnar Brinkmann; Thomas Harmuth. All Ramsey numbers \(r(K_ 3,G)\) for connected graphs of order 9. The electronic journal of combinatorics, Tome 5 (1998). doi: 10.37236/1345

Cité par Sources :