Weighted Turán densities for hypergraphs
David James, Bernard Lidický, Dhruv Mubayi
Abstract
Bondy and Tuza generalized the Turán problem for graphs to weighted graphs. Subsequently, Füredi and Kündgen gave a solution in the case of cliques. We consider the weighted Turán problem on hypergraphs and prove the first tight asymptotic result for 3-uniform hypergraphs. Specifically, we determine the weighted Turán density of the generalized triangle F5 = \abc, abd, cde\. We also prove weighted stability results and exact results. Many intriguing open problems remain, the most tantalizing of which is to determine the weighted Turán density of the tetrahedron. Bounds for this density using flag algebras are presented.
Create a lesson
Related papers
Fractional colorings of Kr-free graphs with local demands
Ewan Davies, Abhishek Dhawan, Abhishek Methuku et al.
Short permutation pattern waves: The complete length-five classification
Lihong Qiu, Minglei Mao, Yaping Mao
Automatic partition identities
Laurent Bartholdi
Well-Covered Powers: Cartesian Products and Cayley Graphs
Haobo Ma, Thanh Vu, Wenlin Zhang
Lemmas and Conjectures in Spectral Graph Theory
Tristan Cazenave
On the lower- and upper bounds of three-colored anti-Ramsey numbers
Máté Giesz