Linear Turán problems with bounded matching number in hypergraphs

DOI10.1016/J.DISC.2025.114772MaRDI QIDQ6884392zbMATH OpenFDO

Authors Junpeng Zhou, Xiying Yuan

Publication date 15 December 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114772

zbMATH Keywords

expansionlinear hypergraphlinear Turán numbermatching number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A linear hypergraph extension of Turán's theorem
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Asymptotics for the Turán number of Berge-\(K_{2,t}\)
• Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• scientific article; zbMATH DE number 4200236 (Why is no real title available?)
• scientific article; zbMATH DE number 3609704 (Why is no real title available?)
• scientific article; zbMATH DE number 3221072 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• Improved bounds for Erdős' matching conjecture
• Linear Turán numbers of acyclic triple systems
• Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
• On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
• On non-degenerate Turán problems for expansions
• The history of degenerate (bipartite) extremal graph problems
• The maximum spectral radius of graphs without friendship subgraphs
• Turán graphs with bounded matching number
• Turán numbers for hypergraph star forests
• Turán problems for star-path forests in hypergraphs

This page was built for publication: Linear Turán problems with bounded matching number in hypergraphs

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