Lagrangians of Hypergraphs
From MaRDI portal
Publication:3147280
DOI10.1017/S0963548301005053zbMath0998.05049OpenAlexW2119362633MaRDI QIDQ3147280
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
Related Items (43)
On Frankl and Füredi's conjecture for 3-uniform hypergraphs ⋮ Connection between the clique number and the Lagrangian of 3-uniform hypergraphs ⋮ A Motzkin-Straus type result for 3-uniform hypergraphs ⋮ On substructure densities of hypergraphs ⋮ Some results on Lagrangians of hypergraphs ⋮ On graph-Lagrangians and clique numbers of 3-uniform hypergraphs ⋮ An Irrational Lagrangian Density of a Single Hypergraph ⋮ Unnamed Item ⋮ The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs ⋮ Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions ⋮ Maximisers of the hypergraph Lagrangian outside the principal range ⋮ The Hessian matrix of Lagrange function ⋮ A homogeneous polynomial associated with general hypergraphs and its applications ⋮ Using Lagrangians of hypergraphs to find non-jumping numbers. II. ⋮ Extremal problems for the \(p\)-spectral radius of Berge hypergraphs ⋮ A hypergraph Turán theorem via Lagrangians of intersecting families ⋮ The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex ⋮ A tensor optimization algorithm for computing Lagrangians of hypergraphs ⋮ Lagrangian-perfect hypergraphs ⋮ \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles ⋮ Lagrangians of hypergraphs: the Frankl-Füredi conjecture holds almost everywhere ⋮ Non-jumping numbers for 5-uniform hypergraphs ⋮ Lagrangian densities of linear forests and Turán numbers of their extensions ⋮ An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications ⋮ Two extremal problems related to orders ⋮ On graph-Lagrangians of hypergraphs containing dense subgraphs ⋮ On the largest graph-Lagrangian of 3-graphs with fixed number of edges ⋮ The extremal \(p\)-spectral radius of Berge hypergraphs ⋮ A note on the structure of Turán densities of hypergraphs ⋮ On Lagrangians of \(r\)-uniform hypergraphs ⋮ Generating non-jumping numbers recursively ⋮ Dense 3-uniform hypergraphs containing a large clique ⋮ Computing the \(p\)-spectral radii of uniform hypergraphs with applications ⋮ A note on generalized Lagrangians of non-uniform hypergraphs ⋮ The connection between polynomial optimization, maximum cliques and Turán densities ⋮ Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Some Motzkin-Straus type results for non-uniform hypergraphs ⋮ Lagrangians of hypergraphs. II: When colex is best ⋮ Lagrangian densities of enlargements of matchings in hypergraphs ⋮ Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false ⋮ An irrational Turán density via hypergraph Lagrangian densities ⋮ A hypergraph Turán theorem via Lagrangians of intersecting families
This page was built for publication: Lagrangians of Hypergraphs
