On the Random Turán Number of Linear Cycles
Random Structures & Algorithms · 2026-05 · 68 (3)
DOI: 10.1002/rsa.70058 ↗Kurz gefasst
Fachartikel in der Zeitschrift Random Structures & Algorithms, online erschienen am 06.04.2026. Verfasst von Dhruv Mubayi und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 24 Literaturangaben. Gefördert von: Simons Foundation, National Science Foundation, H2020 Marie Skłodowska-Curie Actions.
Abstract (Originalsprache)
Given two ‐uniform hypergraphs and the Turán number is the maximum number of edges in an ‐free subgraph of . We study the typical value of when , the Erdös‐Rényi random ‐uniform hypergraph, and , the ‐uniform linear cycle of length . The case of graphs () is a longstanding open problem that has been investigated by many researchers. We determine the order of magnitude of for all and all up to polylogarithmic factors for all values of . Our proof is based on the container method and uses a balanced supersaturation result for linear even cycles, which improves upon previous such results by Ferber‐McKinley‐Samotij and Balogh‐Narayanan‐Skokan.
Förderung
- Simons Foundation
- National Science Foundation
- H2020 Marie Skłodowska-Curie Actions
Zitieren
APA
Mubayi, D., & Yepremyan, L. (2026). On the Random Turán Number of Linear Cycles. Random Structures & Algorithms, 68(3). https://doi.org/10.1002/rsa.70058
Vancouver
Mubayi D, Yepremyan L. On the Random Turán Number of Linear Cycles. Random Structures & Algorithms. 2026;68(3). doi:10.1002/rsa.70058
BibTeX
@article{Mubayi2026,
author = {Mubayi, Dhruv and Yepremyan, Liana},
title = {On the Random Turán Number of Linear Cycles},
journal = {Random Structures & Algorithms},
year = {2026},
volume = {68},
number = {3},
doi = {10.1002/rsa.70058}
}
EUVIMED