alphaFeedback

WorksMathematics

Weighted Turán densities for hypergraphs

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}F_5 = \{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.

Paper details

vlnc:W_drw73ke8
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

arXiv nonexclusive license

Original source

  • Mathematics

ChatGPT-6 · View statement →

Looking for related papers…