Two extremal problems related to orders

DOI10.1007/S10878-017-0196-ZzbMath1415.05091OpenAlexW2766266553MaRDI QIDQ1702839

Biao Wu, Yue Jian Peng

Publication date: 1 March 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0196-z

zbMATH Keywords

colex orderLagrangian of hypergraphsorder \(U\)union-closure

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• On Frankl and Füredi's conjecture for 3-uniform hypergraphs
• Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
• On the largest graph-Lagrangian of 3-graphs with fixed number of edges
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
• Extremal problems whose solutions are the blowups of the small Witt- designs
• Hypergraphs do not jump
• Some results on Lagrangians of hypergraphs
• The union closure method for testing a fixed sequence of families of hypotheses
• Lagrangians of Hypergraphs
• Maxima for Graphs and a New Proof of a Theorem of Turán

This page was built for publication: Two extremal problems related to orders