Non-uniform Turán-type problems

DOI10.1016/J.JCTA.2004.11.010MaRDI QIDQ2484510zbMATH OpenOpenAlexFDO

Authors Dhruv Mubayi, Yi Zhao

Publication date 1 August 2005

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcta.2004.11.010

zbMATH Keywords

extremal set theoryhypergraph Turán problem

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Recommendations

• Lower bounds for Turán's problem
• On a two-sided Turán problem
• What we know and what we do not know about Turán numbers
• Upper bounds for Turán numbers
• A new approach to Turán's conjecture

Cites work

• scientific article; zbMATH DE number 4200236 (Why is no real title available?)
• scientific article; zbMATH DE number 3407723 (Why is no real title available?)
• Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
• On frequent sets of Boolean matrices
• Supersaturated graphs and hypergraphs
• What we know and what we do not know about Turán numbers

Cited in

(8)

• On set systems with a threshold property
• Turán problems on non-uniform hypergraphs
• Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
• On a two-sided Turán problem
• Turán density of 2-edge-colored bipartite graphs with application on \(\{2, 3\}\)-hypergraphs
• On the Turán density of \(\{1, 3\}\)-hypergraphs
• Upper bounds for Turán numbers
• scientific article; zbMATH DE number 4045750 (Why is no real title available?)

This page was built for publication: Non-uniform Turán-type problems

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