login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A208647 Numerators of Pokrovskiy's lower bound on the ratio of e(G^n) the number of edges in the n-th power of a graph G, to E(G) the number of edges of G. 1

%I #6 Mar 30 2012 18:40:59

%S 1,1,1,7,2,2,17,3,3,31,4,4,49,5,5,71

%N Numerators of Pokrovskiy's lower bound on the ratio of e(G^n) the number of edges in the n-th power of a graph G, to E(G) the number of edges of G.

%C Denominators are A208648. The fractions begin: 1/2, 1/2, 7/4, 2/1, 2/1, 17/6, 3/1, 3/1, 31/8, 4/1, 4/1, 49/10, 5/1, 5/1, 71/12.

%H Alexey Pokrovskiy, <a href="http://arxiv.org/abs/1202.6085">Edge growth in graph powers</a>, arXiv:1202.6085v1 [math.CO], Feb 27, 2012.

%F If n == 0 (mod 3) then e(G^n)/e(G) = ((n+3)/3) - 3/(2*(n+3));

%F If n =/= 0 (mod 3) then e(G^n)/e(G) = ceiling(n/3).

%Y Cf. A208648.

%K nonn,easy,frac

%O 0,4

%A _Jonathan Vos Post_, Feb 29 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 22:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)