Using Lagrangians of hypergraphs to find non-jumping numbers. I

DOI10.1007/S00026-008-0353-2MaRDI QIDQ1021376zbMATH OpenOpenAlexFDO

Authors Yuejian Peng

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

zbMATH Keywords

infinite sequences of non-jumping numbers

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Recommendations

• Using Lagrangians of hypergraphs to find non-jumping numbers. II.
• Non-jumping numbers for 4-uniform hypergraphs
• A note on non-jumping numbers
• Subgraph densities in hypergraphs
• Non-jumping numbers for 5-uniform hypergraphs

Cited in

(14)

• On non-strong jumping numbers and density structures of hypergraphs
• A note on non-jumping numbers for \(r\)-uniform hypergraphs
• Computing the \(p\)-spectral radii of uniform hypergraphs with applications
• Non-jumping numbers for 5-uniform hypergraphs
• On the algebraic and topological structure of the set of Turán densities
• A note on non-jumping numbers
• GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS
• Some Motzkin-Straus type results for non-uniform hypergraphs
• Generating non-jumps from a known one
• On substructure densities of hypergraphs
• Non-jumping numbers for 4-uniform hypergraphs
• Using Lagrangians of hypergraphs to find non-jumping numbers. II.
• Generating non-jumping numbers recursively
• On jumping densities of hypergraphs

This page was built for publication: Using Lagrangians of hypergraphs to find non-jumping numbers. I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1021376)