EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Random Turán Problems for Hypergraph Expansions

Jiaxi Nie, Sam Spiro

Random Structures & Algorithms · 2026-12 · 69 (4)

DOI: 10.1002/rsa.70104 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Random Structures & Algorithms, online erschienen am 29.10.2026. Verfasst von Jiaxi Nie und 1 weiteren Autor:innen. Die Arbeit nennt 37 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Given an ‐uniform hypergraph , we define its ‐uniform expansion to be the hypergraph obtained from by inserting distinct vertices into each edge of , and we define to be the largest ‐free subgraph of the random hypergraph . We initiate the first systematic study of for general hypergraphs . Our main result essentially resolves this problem for large by showing that goes through three predictable phases whenever is Sidorenko and is sufficiently large, with the behavior of being provably more complex whenever has no Sidorenko expansion. Moreover, our methods unify and generalize almost all previously known results for the random Turán problem for degenerate hypergraphs of uniformity at least 3.

Förderung

  • National Science Foundation

Zitieren

APA

Nie, J., & Spiro, S. (2026). Random Turán Problems for Hypergraph Expansions. Random Structures & Algorithms, 69(4). https://doi.org/10.1002/rsa.70104

Vancouver

Nie J, Spiro S. Random Turán Problems for Hypergraph Expansions. Random Structures & Algorithms. 2026;69(4). doi:10.1002/rsa.70104

BibTeX
@article{Nie2026,
  author = {Nie, Jiaxi and Spiro, Sam},
  title = {Random Turán Problems for Hypergraph Expansions},
  journal = {Random Structures & Algorithms},
  year = {2026},
  volume = {69},
  number = {4},
  doi = {10.1002/rsa.70104}
}
Kostenlos starten →