The codegree Turán density of tight cycles minus one edge
Creators
-
1.
University of Birmingham
-
2.
Emory University
-
3.
California Institute of Technology
Abstract
Given α > 0 and an integer ℓ ≥ 5, we prove that every sufficiently large 3-uniform hypergraph H on n vertices in which every two vertices are contained in at least αn edges contains a copy of C−ℓ, a tight cycle on ℓ vertices minus one edge. This improves a previous result by Balogh, Clemen, and Lidický.
Copyright and License
© The Author(s), 2023. Published by Cambridge University Press. This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Funding
S. Piga, is supported by EPSRC grant EP/V002279/1. The second author is partially suported by NSF grant DMS 1764385. There are no additional data beyond that contained within the main manuscript.
Files
the-codegree-turan-density-of-tight-cycles-minus-one-edge.pdf
Files
(235.9 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:cb5c84ed84417b316720eae247c01226
|
235.9 kB | Preview Download |
Additional details
Related works
- Is new version of
- Discussion Paper: arXiv:2211.12721 (arXiv)
Funding
- Engineering and Physical Sciences Research Council
- EP/V002279/1
- National Science Foundation
- DMS 1764385
Dates
- Accepted
-
2023-05-17
- Available
-
2023-07-05Published online