Generalized Turán problem for complete hypergraphs

DOI10.1137/22M1522644MaRDI QIDQ7326082zbMATH OpenFDO

Authors Levente Bodnar

Publication date 8 September 2026

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/22M1522644

Mathematics Subject Classification ID

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

Cites work

• An upper bound for the Turán number \(t_3(n,4)\)
• Flag algebras
• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• scientific article; zbMATH DE number 3843786 (Why is no real title available?)
• scientific article; zbMATH DE number 3869331 (Why is no real title available?)
• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• scientific article; zbMATH DE number 3050594 (Why is no real title available?)
• scientific article; zbMATH DE number 7829304 (Why is no real title available?)
• Improving bounds on packing densities of 4-point permutations
• Inversion of a tridiagonal Jacobi matrix
• Many \(T\) copies in \(H\)-free graphs
• On 3-hypergraphs with forbidden 4-vertex configurations
• On the structure of linear graphs
• Precise values of Turan numbers
• Semidefinite programming and Ramsey numbers
• Some extremal results on hypergraph Turán problems
• What we know and what we do not know about Turán numbers

This page was built for publication: Generalized Turán problem for complete hypergraphs

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