Using Lagrangians of hypergraphs to find non-jumping numbers. I
From MaRDI portal
Publication:1021376
DOI10.1007/s00026-008-0353-2zbMath1201.05101OpenAlexW1970965031MaRDI QIDQ1021376
Publication date: 8 June 2009
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-008-0353-2
Related Items (10)
A note on non-jumping numbers for \(r\)-uniform hypergraphs ⋮ On substructure densities of hypergraphs ⋮ Using Lagrangians of hypergraphs to find non-jumping numbers. II. ⋮ Non-jumping numbers for 5-uniform hypergraphs ⋮ Generating non-jumping numbers recursively ⋮ Computing the \(p\)-spectral radii of uniform hypergraphs with applications ⋮ On jumping densities of hypergraphs ⋮ Some Motzkin-Straus type results for non-uniform hypergraphs ⋮ On non-strong jumping numbers and density structures of hypergraphs ⋮ On the algebraic and topological structure of the set of Turán densities
This page was built for publication: Using Lagrangians of hypergraphs to find non-jumping numbers. I
