On Tur\'{a}n problems for suspension hypergraphs
Combinatorics
2025-02-18 v1
Abstract
For a given graph , the -uniform suspension of is the -uniform hypergraph obtained from by taking 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