Zoltan Furedi, Younjin Kim
Published 2012-04-20Version 1
In this paper it is proved that there are constants 0< c_2< c_1 such that an asymptotic formula can be given for the the number of (labeled) n-vertex graphs of diameter d whenever n tends to infinity and 2 < d < n - c_1 (log n). A typical graph of diameter d consists of a combination of an induced path of length d and a highly connected block of size n-d+3. In the case d > n- c_2(log n) another asymptotic formula is calculated and the typical graph has a completely different snakelike structure.
Asymptotic formula for the $M_2$-ranks of overpartitions
An improved asymptotic formula for the distribution of irreducible polynomials in arithmetic progressions over Fq
Counting connected hypergraphs via the probabilistic method
![QR code for arXiv:1204.4580 [math.CO]](http://oss.arxitics.com/images/favicon.svg)