On hypergraph Turán problems with bounded matching number

DOI10.1016/J.EJC.2025.104155MaRDI QIDQ6976301zbMATH OpenFDO

Authors Dániel Gerbner, Casey Tompkins, Junpeng Zhou

Publication date 2 June 2025

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2025.104155

zbMATH Keywords

\(r\)-uniform hypergraphproper \(k\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A hypergraph extension of Turán's theorem
• A survey of Turán problems for expansions
• 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 3221072 (Why is no real title available?)
• Improved bounds for Erdős' matching conjecture
• On extremal problems of graphs and generalized graphs
• The history of degenerate (bipartite) extremal graph problems
• Turán graphs with bounded matching number

This page was built for publication: On hypergraph Turán problems with bounded matching number

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