Geodesic
On Ramsey minimal graphs
The electronic journal of combinatorics, Tome 1 (1994)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

An elementary probabilistic argument is presented which shows that for every forest $F$ other than a matching, and every graph $G$ containing a cycle, there exists an infinite number of graphs $J$ such that $J\to (F,G)$ but if we delete from $J$ any edge $e$ the graph $J-e$ obtained in this way does not have this property.
DOI : 10.37236/1184
Classification : 05C55
Mots-clés : Ramsey minimal graphs, forest, cycle 
@article{10_37236_1184,
     author = {Tomasz {\L}uczak},
     title = {On {Ramsey} minimal graphs},
     journal = {The electronic journal of combinatorics},
     year = {1994},
     volume = {1},
     doi = {10.37236/1184},
     zbl = {0814.05058},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1184/}
}
TY  - JOUR
AU  - Tomasz Łuczak
TI  - On Ramsey minimal graphs
JO  - The electronic journal of combinatorics
PY  - 1994
VL  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1184/
DO  - 10.37236/1184
ID  - 10_37236_1184
ER  - 
%0 Journal Article
%A Tomasz Łuczak
%T On Ramsey minimal graphs
%J The electronic journal of combinatorics
%D 1994
%V 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1184/
%R 10.37236/1184
%F 10_37236_1184
Tomasz Łuczak. On Ramsey minimal graphs. The electronic journal of combinatorics, Tome 1 (1994). doi: 10.37236/1184

Cité par Sources :