Non-jumping numbers for 4-uniform hypergraphs

DOI10.1007/S00373-006-0689-5MaRDI QIDQ878060zbMATH OpenOpenAlexFDO

Authors Yuejian Peng

Publication date 26 April 2007

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-006-0689-5

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Recommendations

• Using Lagrangians of hypergraphs to find non-jumping numbers. II.
• Using Lagrangians of hypergraphs to find non-jumping numbers. I
• A note on non-jumping numbers
• Non-jumping numbers for 5-uniform hypergraphs
• A note on non-jumping numbers for \(r\)-uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 3224335 (Why is no real title available?)
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• A note on non-jumping numbers
• A note on the jumping constant conjecture of Erdős
• Hypergraphs do not jump
• On extremal problems of graphs and generalized graphs
• On the structure of linear graphs

Cited in

(14)

• Subgraph densities in hypergraphs
• Using Lagrangians of hypergraphs to find non-jumping numbers. II.
• Generating non-jumping numbers recursively
• On jumping densities of hypergraphs
• Using Lagrangians of hypergraphs to find non-jumping numbers. I
• On substructure densities of hypergraphs
• On non-strong jumping numbers and density structures of hypergraphs
• On the algebraic and topological structure of the set of Turán densities
• A note on non-jumping numbers for \(r\)-uniform hypergraphs
• A note on the structure of Turán densities of hypergraphs
• Non-jumping numbers for 5-uniform hypergraphs
• A note on non-jumping numbers
• GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS
• Generating non-jumps from a known one

This page was built for publication: Non-jumping numbers for 4-uniform hypergraphs

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