Upper bounds for Turán numbers

DOI10.1006/JCTA.1996.2739zbMATH Open0873.05003OpenAlexW2029616558MaRDI QIDQ5961541FDOQ5961541

Authors: Alexander Sidorenko 

Publication date: 26 October 1997

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

Full work available at URL: https://doi.org/10.1006/jcta.1996.2739

Recommendations

• Constructive Upper Bounds for the Turán Number
• What we know and what we do not know about Turán numbers
• Non-uniform Turán-type problems
• scientific article; zbMATH DE number 4097380
• scientific article

zbMATH Keywords

upper boundsset systemTurán number

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cited In (19)

• Tournaments, 4-uniform hypergraphs, and an exact extremal result
• An upper bound for the Turán number \(t_3(n,4)\)
• Improved bounds on a generalization of Tuza's conjecture
• Some sharp results on the generalized Turán numbers
• Generalized Tuza's conjecture for random hypergraphs
• On set systems with a threshold property
• Turán problems on non-uniform hypergraphs
• What we know and what we do not know about Turán numbers
• Extremal problems in hypergraph colourings
• Extremal problems on set systems
• Turán numbers of \(r\)-graphs on \(r + 1\) vertices
• Title not available (Why is that?)
• Asymptotic bounds for general covering designs
• Minimum number of affine simplices of given dimension
• Regular Tur\'an numbers
• Non-uniform Turán-type problems
• On Turán numbers for disconnected hypergraphs
• Colorings of hypergraphs with large number of colors
• Colorings of hypergraphs with large number of colors

This page was built for publication: Upper bounds for Turán numbers

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