Extremal uncrowded hypergraphs
From MaRDI portal
Publication:1164072
DOI10.1016/0097-3165(82)90049-8zbMath0485.05049WikidataQ105583589 ScholiaQ105583589MaRDI QIDQ1164072
Endre Szemerédi, János Komlós, János Pintz, J. H. Spencer, Miklós Ajtai
Publication date: 1982
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(82)90049-8
Related Items
On uncrowded hypergraphs, On the Independence Number of Steiner Systems, The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers, On independent sets in hypergraphs, Counting Independent Sets in Hypergraphs, Independence in uniform linear triangle-free hypergraphs, Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs, Large triangles in the \(d\)-dimensional unit cube, Distributions of points in \(d\) dimensions and large \(k\) -point simplices, Point sets in the unit square and large areas of convex hulls of subsets of points, Generalizations of Heilbronn's triangle problem, Probabilistic methods, A note on the independence number of triangle-free graphs. II, Fractional v. integral covers in hypergraphs of bounded edge size, On Erdős-Rado numbers, Point sets with distinct distances, Distributions of points in the unit square and large \(k\)-gons, On the chromatic number of set systems, A note on the random greedy independent set algorithm, Generalizations of Heilbronn's Triangle Problem, No l Grid-Points in Spaces of Small Dimension
Cites Work
