Geodesic
Large holes in quasi-random graphs
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Quasi-random graphs have the property that the densities of almost all pairs of large subsets of vertices are similar, and therefore we cannot expect too large empty or complete bipartite induced subgraphs in these graphs. In this paper we answer the question what is the largest possible size of such subgraphs. As an application, a degree condition that guarantees the connection by short paths in quasi-random pairs is stated.
DOI : 10.37236/784
Classification : 05C80, 05C35
Mots-clés : quasi random graphs, density of large subsets, largest size empty subgraphs, largest size of complete bipartite induced subgraphs 
@article{10_37236_784,
     author = {Joanna Polcyn},
     title = {Large holes in quasi-random graphs},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/784},
     zbl = {1159.05048},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/784/}
}
TY  - JOUR
AU  - Joanna Polcyn
TI  - Large holes in quasi-random graphs
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/784/
DO  - 10.37236/784
ID  - 10_37236_784
ER  - 
%0 Journal Article
%A Joanna Polcyn
%T Large holes in quasi-random graphs
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/784/
%R 10.37236/784
%F 10_37236_784
Joanna Polcyn. Large holes in quasi-random graphs. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/784

Cité par Sources :