Lagrangians of Hypergraphs
From MaRDI portal
Publication:3147280
DOI10.1017/S0963548301005053zbMATH Open0998.05049OpenAlexW2119362633MaRDI QIDQ3147280FDOQ3147280
Authors: Jean-Marc Talbot 
Publication date: 19 November 2002
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548301005053
Recommendations
- Some results on Lagrangians of hypergraphs
- On Lagrangians of \(r\)-uniform hypergraphs
- On graph-Lagrangians of hypergraphs containing dense subgraphs
- scientific article; zbMATH DE number 7365832
- A note on generalized Lagrangians of non-uniform hypergraphs
- Lagrangian-perfect hypergraphs
- An extremal problem on Lagrangians of hypergraphs
- On cliques and Lagrangians of hypergraphs
- scientific article; zbMATH DE number 475375
- Lagrangians of hypergraphs. II: When colex is best
Cited In (45)
- A tensor optimization algorithm for computing Lagrangians of hypergraphs
- Some Motzkin-Straus type results for non-uniform hypergraphs
- The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex
- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
- Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
- Dense 3-uniform hypergraphs containing a large clique
- Using Lagrangians of hypergraphs to find non-jumping numbers. II.
- A hypergraph Turán theorem via Lagrangians of intersecting families
- Generating non-jumping numbers recursively
- On graph-Lagrangians of hypergraphs containing dense subgraphs
- The connection between polynomial optimization, maximum cliques and Turán densities
- On Lagrangians of \(r\)-uniform hypergraphs
- On substructure densities of hypergraphs
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- Lagrangian densities of linear forests and Turán numbers of their extensions
- Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
- On Frankl and Füredi's conjecture for 3-uniform hypergraphs
- Lagrangian densities of enlargements of matchings in hypergraphs
- An irrational Turán density via hypergraph Lagrangian densities
- Title not available (Why is that?)
- A note on the structure of Turán densities of hypergraphs
- Lagrangian-perfect hypergraphs
- Extremal problems for the \(p\)-spectral radius of Berge hypergraphs
- On graph-Lagrangians and clique numbers of 3-uniform hypergraphs
- The extremal \(p\)-spectral radius of Berge hypergraphs
- Non-jumping numbers for 5-uniform hypergraphs
- A hypergraph Turán theorem via Lagrangians of intersecting families
- On the largest graph-Lagrangian of 3-graphs with fixed number of edges
- On cliques and Lagrangians of hypergraphs
- A Motzkin-Straus type result for 3-uniform hypergraphs
- Maximisers of the hypergraph Lagrangian outside the principal range
- \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles
- A homogeneous polynomial associated with general hypergraphs and its applications
- Some results on Lagrangians of hypergraphs
- The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs
- Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false
- On finding Lagrangians of 3-uniform hypergraphs.
- The Hessian matrix of Lagrange function
- Lagrangians of hypergraphs. II: When colex is best
- Two extremal problems related to orders
- An irrational Lagrangian density of a single hypergraph
- Title not available (Why is that?)
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
- On Hamiltonian Berge cycles in [3]-uniform hypergraphs
- A note on generalized Lagrangians of non-uniform hypergraphs
This page was built for publication: Lagrangians of Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147280)
