Two extremal problems related to orders
From MaRDI portal
Recommendations
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
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)