On Lagrangians of 3-uniform hypergraphs missing edges in a large clique

MaRDI QIDQ5501169zbMATH OpenFDO

Authors Yanling Zheng

Publication date 13 August 2015

Full work available at URL http://www.ceser.in/ceserp/index.php/ijms/article/view/3446

zbMATH Keywords

colex orderingLagrangians of hypergraphsoptimal weightingleft-compressed

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65)

Recommendations

• On Frankl and Füredi's conjecture for 3-uniform hypergraphs
• Some results on Lagrangians of hypergraphs
• On the largest graph-Lagrangian of 3-graphs with fixed number of edges

Cited in

(9)

• Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
• An extremal problem on Lagrangians of hypergraphs
• On Frankl and Füredi's conjecture for 3-uniform hypergraphs
• scientific article; zbMATH DE number 6503350 (Why is no real title available?)
• On graph-Lagrangians and clique numbers of 3-uniform hypergraphs
• On the largest graph-Lagrangian of 3-graphs with fixed number of edges
• \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles
• On finding Lagrangians of 3-uniform hypergraphs.
• A note on generalized Lagrangians of non-uniform hypergraphs

This page was built for publication: On Lagrangians of 3-uniform hypergraphs missing edges in a large clique

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