On graph-Lagrangians and clique numbers of 3-uniform hypergraphs
From MaRDI portal
Publication:326974
Recommendations
- Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
- On graph-Lagrangians of hypergraphs containing dense subgraphs
- On Lagrangians of 3-uniform hypergraphs missing edges in a large clique
- Model-order reduction ofkth order MIMO dynamical systems using blockkth order Krylov subspaces
- On the largest graph-Lagrangian of 3-graphs with fixed number of edges
Cites work
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- A Motzkin-Straus type result for 3-uniform hypergraphs
- A hypergraph Turán theorem via Lagrangians of intersecting families
- 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
- On Frankl and Füredi's conjecture for 3-uniform hypergraphs
- On Lagrangians of \(r\)-uniform hypergraphs
- On graph-Lagrangians of hypergraphs containing dense subgraphs
- On the largest graph-Lagrangian of 3-graphs with fixed number of edges
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- Some results on Lagrangians of hypergraphs
Cited in
(11)- Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
- Dense 3-uniform hypergraphs containing a large clique
- scientific article; zbMATH DE number 57410 (Why is no real title available?)
- An extremal problem on Lagrangians of hypergraphs
- Model-order reduction ofkth order MIMO dynamical systems using blockkth order Krylov subspaces
- scientific article; zbMATH DE number 6503350 (Why is no real title available?)
- The lifting of graphs to 3-uniform hypergraphs and some applications to hypergraph Ramsey theory
- On cliques and Lagrangians of hypergraphs
- A Motzkin-Straus type result for 3-uniform hypergraphs
- Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal
- On finding Lagrangians of 3-uniform hypergraphs.
This page was built for publication: On graph-Lagrangians and clique numbers of 3-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326974)