On an extremal hypergraph problem of Brown, Erdős and Sós
From MaRDI portal
Publication:879166
DOI10.1007/s00493-006-0035-9zbMath1121.05079OpenAlexW2046549378MaRDI QIDQ879166
Publication date: 8 May 2007
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-006-0035-9
Related Items
2-Cancellative Hypergraphs and Codes ⋮ Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques ⋮ Separating Hash Families: A Johnson-type bound and New Constructions ⋮ Nearly complete graphs decomposable into large induced matchings and their applications ⋮ Uniform hypergraphs containing no grids ⋮ Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity ⋮ Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points ⋮ Singleton-type bounds for list-decoding and list-recovery, and related results ⋮ Local-vs-global combinatorics ⋮ Sparse Hypergraphs with Applications to Coding Theory ⋮ Sparse hypergraphs: new bounds and constructions ⋮ New Turán Exponents for Two Extremal Hypergraph Problems ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Degenerate Turán densities of sparse hypergraphs ⋮ Hypergraph based Berge hypergraphs ⋮ Triple systems with no three triples spanning at most five points ⋮ The asymptotic induced matching number of hypergraphs: balanced binary strings ⋮ A new bound for the Brown-Erdős-Sós problem ⋮ Turán numbers and batch codes
This page was built for publication: On an extremal hypergraph problem of Brown, Erdős and Sós
