On Turán problems for suspension hypergraphs

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Cheng, Xin, Gerbner, Dániel, Karim, Hilal Hama, Zhou, Junpeng
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866915154101272576
author Cheng, Xin
Gerbner, Dániel
Karim, Hilal Hama
Zhou, Junpeng
author_facet Cheng, Xin
Gerbner, Dániel
Karim, Hilal Hama
Zhou, Junpeng
contents For a given graph $F$, the $r$-uniform suspension of $F$ is the $r$-uniform hypergraph obtained from $F$ by taking $r-2$ new vertices and adding them to every edge. In this paper, we consider Turán problems on suspension hypergraphs, and we obtain several general and exact results.
format Preprint
id arxiv_https___arxiv_org_abs_2502_10905
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle On Turán problems for suspension hypergraphs
Cheng, Xin
Gerbner, Dániel
Karim, Hilal Hama
Zhou, Junpeng
Combinatorics
For a given graph $F$, the $r$-uniform suspension of $F$ is the $r$-uniform hypergraph obtained from $F$ by taking $r-2$ new vertices and adding them to every edge. In this paper, we consider Turán problems on suspension hypergraphs, and we obtain several general and exact results.
title On Turán problems for suspension hypergraphs
topic Combinatorics
url https://arxiv.org/abs/2502.10905