Geodesic
An upper bound on the number of edges of a graph which $k$-th power has connected complement
Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part VIII, Tome 450 (2016), pp. 151-174
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

We call a graph $k$-wide, if for any division of its vertex set into two sets one can choose vertices of distance at least $k$ in these sets (i.e., the complement of $k$-th power of this graph is connected). We call a graph $k$-mono-wide, if for any division of its vertex set into two sets one can choose vertices of distance exactly $k$ in these sets. We prove that the complement of a $3$-wide graph on $n$ vertices has at least $3n-7$ edges and the complement of a $3$-mono-wide graph on $n$ vertices has at least $3n-8$ edges. We construct infinite series of graphs for which these bounds are attained. We also prove an asymptotically tight bound for the case $k\ge4$: the complement of a $k$-wide graph contains at least $(n-2k)(2k-4[\log_2k]-1)$ edges. 
@article{ZNSL_2016_450_a7,
     author = {V. S. Samoilov},
     title = {An upper bound on the number of edges of a~graph which $k$-th power has connected complement},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {151--174},
     year = {2016},
     volume = {450},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2016_450_a7/}
}
TY  - JOUR
AU  - V. S. Samoilov
TI  - An upper bound on the number of edges of a graph which $k$-th power has connected complement
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2016
SP  - 151
EP  - 174
VL  - 450
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2016_450_a7/
LA  - ru
ID  - ZNSL_2016_450_a7
ER  - 
%0 Journal Article
%A V. S. Samoilov
%T An upper bound on the number of edges of a graph which $k$-th power has connected complement
%J Zapiski Nauchnykh Seminarov POMI
%D 2016
%P 151-174
%V 450
%U http://geodesic.mathdoc.fr/item/ZNSL_2016_450_a7/
%G ru
%F ZNSL_2016_450_a7
V. S. Samoilov. An upper bound on the number of edges of a graph which $k$-th power has connected complement. Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part VIII, Tome 450 (2016), pp. 151-174. http://geodesic.mathdoc.fr/item/ZNSL_2016_450_a7/

[1] F. Kharari, Teoriya grafov, Mir, M., 1973; F. Harary, Graph Theory, 1969 | MR

[2] R. Diestel, Graph Theory, Springer-Verlag, New York, 1997 | MR | Zbl

[3] J. A. Bondy, U. S. R. Murty, Graph Theory With Applications, North-Holland, New York, 1997

[4] H. Fleischner, “The square of every two-connected graph is Hamiltonian”, J. Combinatorial Theory Ser. B, 16 (1974), 29–34 | DOI | MR | Zbl

[5] A. M. Hobbs, “Some Hamiltonian results in powers of graphs”, J. Research Nat. Bureau Stand. Sect. B, 77 (1973), 1–10 | DOI | MR | Zbl

[6] G. Chartrand, S. F. Kapoor., “The cube of every connected graph is 1-hamiltonian”, J. Research Nat. Bureau Stand. Sect. B, 73 (1969), 47–48 | DOI | MR | Zbl