On graph-Lagrangians and clique numbers of 3-uniform hypergraphs
From MaRDI portal
Publication:326974
DOI10.1007/S10114-016-5472-9zbMATH Open1346.05205OpenAlexW2473979496MaRDI QIDQ326974FDOQ326974
Authors: Yan Ping Sun, Yuejian Peng, Biao Wu 
Publication date: 13 October 2016
Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-016-5472-9
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
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65)
Cites Work
- Hypergraphs do not jump
- Title not available (Why is that?)
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- Title not available (Why is that?)
- A Motzkin-Straus type result for 3-uniform hypergraphs
- Some results on Lagrangians of hypergraphs
- On Frankl and Füredi's conjecture for 3-uniform hypergraphs
- Lagrangians of Hypergraphs
- On graph-Lagrangians of hypergraphs containing dense subgraphs
- On Lagrangians of \(r\)-uniform hypergraphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Extremal problems whose solutions are the blowups of the small Witt- designs
- A hypergraph Turán theorem via Lagrangians of intersecting families
- On the largest graph-Lagrangian of 3-graphs with fixed number of edges
Cited In (11)
- Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
- Dense 3-uniform hypergraphs containing a large clique
- Title not available (Why is that?)
- Model-order reduction ofkth order MIMO dynamical systems using blockkth order Krylov subspaces
- An extremal problem on Lagrangians of hypergraphs
- Title not available (Why is that?)
- 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)
