On an extremal hypergraph problem of Brown, Erdős and Sós
From MaRDI portal
Publication:879166
DOI10.1007/S00493-006-0035-9zbMATH Open1121.05079OpenAlexW2046549378MaRDI QIDQ879166FDOQ879166
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
Cited In (23)
- Uniform hypergraphs containing no grids
- Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques
- On the \((6,4)\)-problem of Brown, Erdős, and Sós
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Separating Hash Families: A Johnson-type bound and New Constructions
- On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
- 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
- Turán numbers of \(r\)-graphs on \(r + 1\) vertices
- Turán numbers and batch codes
- Singleton-type bounds for list-decoding and list-recovery, and related results
- Economical extremal hypergraphs for the Erdős-Selfridge theorem
- Local-vs-global combinatorics
- Sparse Hypergraphs with Applications to Coding Theory
- Triple systems with no three triples spanning at most five points
- Hypergraph based Berge hypergraphs
- The asymptotic induced matching number of hypergraphs: balanced binary strings
- Nearly complete graphs decomposable into large induced matchings and their applications
- A new bound for the Brown-Erdős-Sós problem
- Sparse hypergraphs: new bounds and constructions
- New Turán Exponents for Two Extremal Hypergraph Problems
- Degenerate Turán densities of sparse hypergraphs
- 2-cancellative hypergraphs and codes
This page was built for publication: On an extremal hypergraph problem of Brown, Erdős and Sós
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879166)
