Geodesic
Critical subgraphs of a random graph
The electronic journal of combinatorics, Tome 6 (1999)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We prove that the threshold for a random graph to have a $k$-core is equal to the threshold for having a subgraph which meets a necessary condition of Gallai for being $k$-critical.
DOI : 10.37236/1467
Classification : 05C80, 05C15
Mots-clés : critical subgraphs, random graph, chromatic number 
@article{10_37236_1467,
     author = {Michael Molloy and Bruce Reed},
     title = {Critical subgraphs of a random graph},
     journal = {The electronic journal of combinatorics},
     year = {1999},
     volume = {6},
     doi = {10.37236/1467},
     zbl = {0943.05074},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1467/}
}
TY  - JOUR
AU  - Michael Molloy
AU  - Bruce Reed
TI  - Critical subgraphs of a random graph
JO  - The electronic journal of combinatorics
PY  - 1999
VL  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1467/
DO  - 10.37236/1467
ID  - 10_37236_1467
ER  - 
%0 Journal Article
%A Michael Molloy
%A Bruce Reed
%T Critical subgraphs of a random graph
%J The electronic journal of combinatorics
%D 1999
%V 6
%U http://geodesic.mathdoc.fr/articles/10.37236/1467/
%R 10.37236/1467
%F 10_37236_1467
Michael Molloy; Bruce Reed. Critical subgraphs of a random graph. The electronic journal of combinatorics, Tome 6 (1999). doi: 10.37236/1467

Cité par Sources :