A note on non-jumping numbers

zbMATH Open1201.05050MaRDI QIDQ3517153FDOQ3517153

Yuejian Peng

Publication date: 12 August 2008

Recommendations

• Non-jumping numbers for 4-uniform hypergraphs
• Using Lagrangians of hypergraphs to find non-jumping numbers. I
• Generating non-jumping numbers recursively
• Using Lagrangians of hypergraphs to find non-jumping numbers. II.
• A note on the jumping constant conjecture of Erdős

Mathematics Subject Classification ID

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

Cited In (6)

• Non-jumping numbers for 4-uniform hypergraphs
• Generating non-jumping numbers recursively
• On jumping densities of hypergraphs
• Using Lagrangians of hypergraphs to find non-jumping numbers. I
• Non-jumping numbers for 5-uniform hypergraphs
• Generating non-jumps from a known one

This page was built for publication: A note on non-jumping numbers

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