Geodesic
The Chromatic Number of Random Intersection Graphs
Discussiones Mathematicae. Graph Theory, Tome 37 (2017) no. 2, pp. 465-476

Voir la notice de l'article provenant de la source Library of Science

We study problems related to the chromatic number of a random intersection graph G(n,m, p). We introduce two new algorithms which colour G(n,m, p) with almost optimum number of colours with probability tending to 1 as n → ∞. Moreover we find a range of parameters for which the chromatic number of G(n,m, p) asymptotically equals its clique number.
Keywords: random intersection graphs, chromatic number, colouring algorithms 
@article{DMGT_2017_37_2_a10,
     author = {Rybarczyk, Katarzyna},
     title = {The {Chromatic} {Number} of {Random} {Intersection} {Graphs}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {465--476},
     publisher = {mathdoc},
     volume = {37},
     number = {2},
     year = {2017},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2017_37_2_a10/}
}
TY  - JOUR
AU  - Rybarczyk, Katarzyna
TI  - The Chromatic Number of Random Intersection Graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2017
SP  - 465
EP  - 476
VL  - 37
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2017_37_2_a10/
LA  - en
ID  - DMGT_2017_37_2_a10
ER  - 
%0 Journal Article
%A Rybarczyk, Katarzyna
%T The Chromatic Number of Random Intersection Graphs
%J Discussiones Mathematicae. Graph Theory
%D 2017
%P 465-476
%V 37
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2017_37_2_a10/
%G en
%F DMGT_2017_37_2_a10
Rybarczyk, Katarzyna. The Chromatic Number of Random Intersection Graphs. Discussiones Mathematicae. Graph Theory, Tome 37 (2017) no. 2, pp. 465-476. http://geodesic.mathdoc.fr/item/DMGT_2017_37_2_a10/