Back to Search
Start Over
Graphs with few paths of prescribed length between any two vertices.
- Source :
- Bulletin of the London Mathematical Society; Dec2019, Vol. 51 Issue 6, p1015-1021, 7p
- Publication Year :
- 2019
-
Abstract
- We use a variant of Bukh's random algebraic method to show that for every natural number k⩾2 there exists a natural number ℓ such that, for every n, there is a graph with n vertices and Ωk(n1+1/k) edges with at most ℓ paths of length k between any two vertices. A result of Faudree and Simonovits shows that the bound on the number of edges is tight up to the implied constant. [ABSTRACT FROM AUTHOR]
- Subjects :
- NATURAL numbers
Subjects
Details
- Language :
- English
- ISSN :
- 00246093
- Volume :
- 51
- Issue :
- 6
- Database :
- Complementary Index
- Journal :
- Bulletin of the London Mathematical Society
- Publication Type :
- Academic Journal
- Accession number :
- 140070464
- Full Text :
- https://doi.org/10.1112/blms.12295