Lagrangian densities of some $3$-uniform hypergraphs
Zilong Yan, Yuejian Peng

TL;DR
This paper investigates the properties of $$-uniform hypergraphs related to their Lagrangian densities, proposing conditions under which hypergraphs are $$-perfect and supporting these with partial results and conjectures.
Contribution
It introduces the concept of $$-perfect hypergraphs, explores their properties, and provides partial results supporting conjectures about their structure and union behavior.
Findings
Hypergraphs with edges no more than a linear hyperpath are $$-perfect.
Disjoint unions of $$-perfect hypergraphs can also be $$-perfect under certain conditions.
The paper extends earlier results on hypergraph Lagrangians and $$-perfection.
Abstract
The Lagrangian density of an -uniform hypergraph is multiplying the supremum of the Lagrangians of all -free -uniform hypergraphs. For an -uniform graph with vertices, it is clear that . We say that an -uniform hypergraph with vertices is -perfect if . A theorem of Motzkin and Straus implies that all -uniform graphs are -perfect. It is interesting to understand what kind of hypergraphs are -perfect. The property `-perfect' is monotone in the sense that an -graph obtained by removing an edge from a -perfect -graph (keep the same vertex set) is -perfect. It's interesting to understand the relation between the number of edges in a hypergraph and the `-perfect' property. We propose that the…
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
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Advanced Topology and Set Theory
