Two extremal problems related to orders

DOI10.1007/S10878-017-0196-ZMaRDI QIDQ1702839zbMATH OpenOpenAlexFDO

Authors Biao Wu, Yuejian 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

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

Recommendations

• Some results on Lagrangians of hypergraphs
• A note on generalized Lagrangians of non-uniform hypergraphs
• A note on Lagrangians of 4-uniform hypergraphs.
• Lagrangians of hypergraphs. II: When colex is best
• On Frankl and Füredi's conjecture for 3-uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
• Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
• Extremal problems whose solutions are the blowups of the small Witt- designs
• Hypergraphs do not jump
• Lagrangians of Hypergraphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Minimizing the weight of the union-closure of families of two-sets
• On Frankl and Füredi's conjecture for 3-uniform hypergraphs
• On the largest graph-Lagrangian of 3-graphs with fixed number of edges
• Some results on Lagrangians of hypergraphs
• The union closure method for testing a fixed sequence of families of hypotheses

Cited in

(2)

• Two theorems on units of orders
• Extremal problems for linear orders on \([n]^ p\)

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

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