Positive co-degree densities and jumps
J\'ozsef Balogh, Anastasia Halfpap, Bernard Lidick\'y, Cory Palmer

TL;DR
This paper investigates the positive co-degree densities in hypergraphs, extending known results about jumps, and identifies new achievable values and their properties for specific hypergraph parameters.
Contribution
It extends the range of known jumps in positive co-degree densities and finds new achievable values for specific hypergraph cases, including for r=3.
Findings
Every α in [0, 2/(2r-1)) is a jump.
For r=3, infinitely many values of the form (k-2)/(2k-3) are achievable.
Two additional achievable values for r=3 are determined using flag algebra calculations.
Abstract
The minimum positive co-degree of a nonempty -graph , denoted by , is the largest integer such that for every -set , if is contained in a hyperedge of , then is contained in at least hyperedges of . Given a family of -graphs, the positive co-degree Tur\'an function is the maximum of over all -vertex -graphs containing no member of . The positive co-degree density of is While the existence of is proved for all families , only few positive co-degree densities are known exactly. For a fixed , we call an achievable value if there exists a family…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Advanced Optimization Algorithms Research · Functional Equations Stability Results
