Lower bounds for Turán's problem
From MaRDI portal
Publication:1065822
DOI10.1007/BF02582949zbMath0577.05039OpenAlexW2086678121MaRDI QIDQ1065822
Publication date: 1985
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02582949
Related Items
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, Coverings of r—graphs by complete r—partite subgraphs, Improved bounds on a generalization of Tuza's conjecture
Cites Work
