Generating non-jumps from a known one

DOI10.1007/S11425-023-2196-XMaRDI QIDQ6649849

Jianfeng Hou, Heng Li, Caihong Yang, Yixiao Zhang

Publication date: 6 December 2024

Published in: Science China. Mathematics (Search for Journal in Brave)

zbMATH Keywords

Turán densityjumping numberhypergraph Lagrangiannon-jump

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the algebraic and topological structure of the set of Turán densities
• On possible Turán densities
• Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
• A note on the jumping constant conjecture of Erdős
• 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
• Using Lagrangians of hypergraphs to find non-jumping numbers. I
• Hypergraphs do not jump
• The maximum size of 3-uniform hypergraphs not containing a Fano plane
• Non-jumping Turán densities of hypergraphs
• The Turán number of the Fano plane
• On extremal problems of graphs and generalized graphs
• On some extremal problems on \(r\)-graphs
• Hypergraphs Do Jump
• Subgraph densities in hypergraphs
• Triple Systems Not Containing a Fano Configuration
• On the structure of linear graphs
• Hypergraph Turán densities can have arbitrarily large algebraic degree

This page was built for publication: Generating non-jumps from a known one

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