Geodesic
Ramseyan properties of graphs
The electronic journal of combinatorics, Tome 3 (1996) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Every graph of chromatic number $k$ with more than $k(r-1)(b-1)$ vertices has a $b$-element independent set of vertices such that if any two of them are joined by an edge then the chromatic number stays the same or a $r$-element independent set of vertices such that joining any two of them by an edge increases the chromatic number.
DOI : 10.37236/1250
Classification : 05C55
Mots-clés : Ramsey graph, chromatic number, independent set 
@article{10_37236_1250,
     author = {Ermelinda DeLaVina and Siemion Fajtlowicz},
     title = {Ramseyan properties of graphs},
     journal = {The electronic journal of combinatorics},
     year = {1996},
     volume = {3},
     number = {1},
     doi = {10.37236/1250},
     zbl = {0885.05087},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1250/}
}
TY  - JOUR
AU  - Ermelinda DeLaVina
AU  - Siemion Fajtlowicz
TI  - Ramseyan properties of graphs
JO  - The electronic journal of combinatorics
PY  - 1996
VL  - 3
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1250/
DO  - 10.37236/1250
ID  - 10_37236_1250
ER  - 
%0 Journal Article
%A Ermelinda DeLaVina
%A Siemion Fajtlowicz
%T Ramseyan properties of graphs
%J The electronic journal of combinatorics
%D 1996
%V 3
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1250/
%R 10.37236/1250
%F 10_37236_1250
Ermelinda DeLaVina; Siemion Fajtlowicz. Ramseyan properties of graphs. The electronic journal of combinatorics, Tome 3 (1996) no. 1. doi: 10.37236/1250

Cité par Sources :