Lagrangian densities of enlargements of matchings in hypergraphs

DOI10.1016/J.AMC.2020.125068MaRDI QIDQ2294918zbMATH OpenOpenAlexFDO

Authors Sinan Hu, Yuejian Peng

Publication date 12 February 2020

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2020.125068

zbMATH Keywords

hypergraph LagrangianTurán density

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Extremal set theory (05D05)

Recommendations

• Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
• The Lagrangian density of the disjoint union of a 3-uniform tight path and a matching and the Turán number of its extension
• Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions
• \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles
• The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension

Cites work

• \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles
• A hypergraph Turán theorem via Lagrangians of intersecting families
• A Motzkin-Straus type result for 3-uniform hypergraphs
• An exact Turán result for the generalized triangle
• Asymptotic solution for a new class of forbidden r-graphs
• Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
• Extremal problems whose solutions are the blowups of the small Witt- designs
• GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS
• scientific article; zbMATH DE number 863493 (Why is no real title available?)
• Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false
• Hypergraphs do not jump
• Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
• Lagrangians of Hypergraphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On maximal paths and circuits of graphs
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• On the maximum number of edges in a hypergraph with given matching number
• Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
• Turán numbers of extensions

Cited in

(11)

• Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs
• Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
• Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions
• An irrational Turán density via hypergraph Lagrangian densities
• \(1/n\) expansion for the number of matchings on regular graphs and Monomer-Dimer entropy
• \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles
• The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex
• The Lagrangian density of the disjoint union of a 3-uniform tight path and a matching and the Turán number of its extension
• An irrational Lagrangian density of a single hypergraph
• Lagrangian densities of linear forests and Turán numbers of their extensions
• Lagrangian densities of 4-uniform matchings and degree stability of extremal hypergraphs

This page was built for publication: Lagrangian densities of enlargements of matchings in hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294918)