The largest hole in sparse random graphs. Issue 4 (25th February 2022)
- Record Type:
- Journal Article
- Title:
- The largest hole in sparse random graphs. Issue 4 (25th February 2022)
- Main Title:
- The largest hole in sparse random graphs
- Authors:
- Draganić, Nemanja
Glock, Stefan
Krivelevich, Michael - Abstract:
- Abstract: We show that for any d = d ( n ) with d 0 ( ϵ ) ≤ d = o ( n ), with high probability, the size of a largest induced cycle in the random graph G ( n, d / n ) is ( 2 ± ϵ ) n d log d . This settles a long‐standing open problem in random graph theory.
- Is Part Of:
- Random structures & algorithms. Volume 61:Issue 4(2022)
- Journal:
- Random structures & algorithms
- Issue:
- Volume 61:Issue 4(2022)
- Issue Display:
- Volume 61, Issue 4 (2022)
- Year:
- 2022
- Volume:
- 61
- Issue:
- 4
- Issue Sort Value:
- 2022-0061-0004-0000
- Page Start:
- 666
- Page End:
- 677
- Publication Date:
- 2022-02-25
- Subjects:
- hole -- induced path -- random graph
Random graphs -- Periodicals
Mathematical analysis -- Periodicals
519 - Journal URLs:
- http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1098-2418 ↗
http://onlinelibrary.wiley.com/ ↗ - DOI:
- 10.1002/rsa.21078 ↗
- Languages:
- English
- ISSNs:
- 1042-9832
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 7254.411950
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 24219.xml