On Tur\'an problems for suspension hypergraphs
Abstract
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\'an problems on suspension hypergraphs, and we obtain several general and exact results.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.