EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Hypergraphs with arbitrarily small codegree Turán density

Simón Piga, Bjarne Schülke

Bulletin of the London Mathematical Society · 2026-04 · 58 (4)

DOI: 10.1112/blms.70348 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Bulletin of the London Mathematical Society, online erschienen am 27.03.2026. Verfasst von Simón Piga und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 22 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Engineering and Physical Sciences Research Council.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The codegree Turán density of a ‐graph is the smallest such that every ‐graph with contains a copy of . In this work, we show that for every , there is a ‐uniform hypergraph with . The initial preprint of this work leads to significant subsequent research on accumulation points of variants of the Turán density.

Förderung

  • Engineering and Physical Sciences Research Council

Zitieren

APA

Piga, S., & Schülke, B. (2026). Hypergraphs with arbitrarily small codegree Turán density. Bulletin of the London Mathematical Society, 58(4). https://doi.org/10.1112/blms.70348

Vancouver

Piga S, Schülke B. Hypergraphs with arbitrarily small codegree Turán density. Bulletin of the London Mathematical Society. 2026;58(4). doi:10.1112/blms.70348

BibTeX
@article{Piga2026,
  author = {Piga, Simón and Schülke, Bjarne},
  title = {Hypergraphs with arbitrarily small codegree Turán density},
  journal = {Bulletin of the London Mathematical Society},
  year = {2026},
  volume = {58},
  number = {4},
  doi = {10.1112/blms.70348}
}
Kostenlos starten →