Lower bounds for Turán's problem

DOI10.1007/BF02582949zbMath0577.05039OpenAlexW2086678121MaRDI QIDQ1065822

Vojtěch Rödl, Peter Frankl

Publication date: 1985

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02582949

zbMATH Keywords

Turán numbers

Mathematics Subject Classification ID

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

Related Items (12)

The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent ⋮ Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube ⋮ Hypergraphs with high chromatic number ⋮ Extremal problems on set systems ⋮ What we know and what we do not know about Turán numbers ⋮ On set systems with a threshold property ⋮ Exact solution of some Turán-type problems ⋮ Hypergraphs with independent neighborhoods ⋮ Colorings of hypergraphs with large number of colors ⋮ Generalized Tuza's conjecture for random hypergraphs ⋮ Coverings of r—graphs by complete r—partite subgraphs ⋮ Improved bounds on a generalization of Tuza's conjecture

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Lower bounds for Turán's problem