English

On Tur\'{a}n problems for suspension hypergraphs

Combinatorics 2025-02-18 v1

Abstract

For a given graph FF, the rr-uniform suspension of FF is the rr-uniform hypergraph obtained from FF by taking r2r-2 new vertices and adding them to every edge. In this paper, we consider Tur\'{a}n problems on suspension hypergraphs, and we obtain several general and exact results.

Keywords

Cite

@article{arxiv.2502.10905,
  title  = {On Tur\'{a}n problems for suspension hypergraphs},
  author = {Xin Cheng and Dániel Gerbner and Hilal Hama Karim and Junpeng Zhou},
  journal= {arXiv preprint arXiv:2502.10905},
  year   = {2025}
}

Comments

14 pages

R2 v1 2026-06-28T21:45:38.613Z