Published July 27, 2022
| Version Accepted Version
Journal Article
Open
Ramsey numbers of trails and circuits
Creators
-
1.
California Institute of Technology
-
2.
Charles University
Abstract
We show that every two-colouring of the edges of the complete graph Kₙ contains a monochromatic trail or circuit of length at least 2n²/9+o(n²), which is asymptotically best possible.
Additional Information
© 2022 Wiley Periodicals LLC. Version of Record online: 22 July 2022. Manuscript accepted: 27 June 2022. Manuscript revised: 19 April 2022. Manuscript received: 08 September 2021. Conlon was supported by NSF Award DMS-2054452 and Tyomkyn by ERC Synergy Grant DYNASNET 810115, the H2020-MSCA-RISE Project CoSP-GA No. 823748 and GACR Grant 19-04113Y.Attached Files
Accepted Version - 2109.02633.pdf
Files
2109.02633.pdf
Files
(74.5 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:413f6e79412d80bbe3544ef5e25a02fd
|
74.5 kB | Preview Download |
Additional details
Identifiers
- Eprint ID
- 115854
- Resolver ID
- CaltechAUTHORS:20220726-997455000
Related works
- Describes
- https://arxiv.org/abs/2109.02633 (URL)
Funding
- NSF
- DMS-2054452
- European Research Council (ERC)
- 810115
- European Research Council (ERC)
- 823748
- Grant Agency of the Czech Republic
- 19-04113Y
Dates
- Created
-
2022-07-27Created from EPrint's datestamp field
- Updated
-
2022-07-27Created from EPrint's last_modified field