Color‐biased Hamilton cycles in random graphs. Issue 3 (21st August 2021)
- Record Type:
- Journal Article
- Title:
- Color‐biased Hamilton cycles in random graphs. Issue 3 (21st August 2021)
- Main Title:
- Color‐biased Hamilton cycles in random graphs
- Authors:
- Gishboliner, Lior
Krivelevich, Michael
Michaeli, Peleg - Abstract:
- Abstract: We prove that a random graph G ( n, p ), with p above the Hamiltonicity threshold, is typically such that for any r ‐coloring of its edges there exists a Hamilton cycle with at least ( 2 / ( r + 1 ) − o ( 1 ) ) n edges of the same color. This estimate is asymptotically optimal.
- Is Part Of:
- Random structures & algorithms. Volume 60:Issue 3(2022)
- Journal:
- Random structures & algorithms
- Issue:
- Volume 60:Issue 3(2022)
- Issue Display:
- Volume 60, Issue 3 (2022)
- Year:
- 2022
- Volume:
- 60
- Issue:
- 3
- Issue Sort Value:
- 2022-0060-0003-0000
- Page Start:
- 289
- Page End:
- 307
- Publication Date:
- 2021-08-21
- Subjects:
- discrepancy -- Hamilton cycles -- random graphs
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.21043 ↗
- 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:
- 21030.xml