Positive co-degree Tur\'an number for C5 and C5-
Abstract
The minimum positive co-degree δ+r-1(H) of a non-empty r-graph H is the maximum k such that if S is an (r-1)-set contained in a hyperedge of H, then S is contained in at least k hyperedges of H. For any r-graph F, the positive degree Tur\'an number co+ex(n,F) is defined as the maximum value of δ+r-1(H) over all n-vertex F-free non-empty r-graphs H. In this paper, we determine the positive degree Tur\'an number for C5 and C5-.
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.