Lagrangian densities of enlargements of matchings in hypergraphs

Sinan Hu and Yuejian Peng

Applied Mathematics and Computation, 2020, vol. 374, issue C

Abstract: Determining the Turán density of a hypergraph is a central and challenging question in extremal combinatorics. We know very few about the Turán densities of hypergraphs. Even the conjecture given by Turán on the Turán density of K43, the smallest complete hypergraph remains open. It turns out that the hypergraph Lagrangian method, a continuous optimization method has been helpful in hypergraph extremal problems. In this paper, we intend to explore this method further, and try to understand the Turán densities of hypergraphs via Lagrangian densities.

Keywords: Hypergraph Lagrangian; Turán density (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320300370
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:374:y:2020:i:c:s0096300320300370

DOI: 10.1016/j.amc.2020.125068

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().