On an extremal hypergraph problem of Brown, Erdős and Sós
From MaRDI portal
Publication:879166
Recommendations
- On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
- A new bound for the Brown-Erdős-Sós problem
- Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity
- An extension of the Ruzsa-Szemerédi theorem
- On Ramsey - Turan type theorems for hypergraphs
Cited in
(37)- Hypergraph based Berge hypergraphs
- 2-cancellative hypergraphs and codes
- Uniform hypergraphs containing no grids
- Sparse hypergraphs with applications to coding theory
- Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points
- Separating hash families: a Johnson-type bound and new constructions
- Small cores in 3-uniform hypergraphs
- The maximum size of hypergraphs without generalized 4-cycles
- scientific article; zbMATH DE number 4128841 (Why is no real title available?)
- A new bound for the Brown-Erdős-Sós problem
- scientific article; zbMATH DE number 4152423 (Why is no real title available?)
- The asymptotic induced matching number of hypergraphs: balanced binary strings
- Turán numbers of \(r\)-graphs on \(r + 1\) vertices
- An extension of the Ruzsa-Szemerédi theorem
- Economical extremal hypergraphs for the Erdős-Selfridge theorem
- The Brown-Erdős-Sós conjecture in finite abelian groups
- The limit in the $(k+2, k)$-Problem of Brown, Erd\H{o}s and S\'os exists for all $k\geq 2$
- Turán numbers and batch codes
- Nearly complete graphs decomposable into large induced matchings and their applications
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On a Problem of Erdos and Lovasz. II: n(r) = O(r)
- Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques
- Constructing dense grid-free linear 3-graphs
- Extremal problems concerning transformations of the edges of the complete hypergraphs
- On the \((6,4)\)-problem of Brown, Erdős, and Sós
- scientific article; zbMATH DE number 3407723 (Why is no real title available?)
- Local-vs-global combinatorics
- The extremal number of surfaces
- On extremal problems concerning the traces of sets
- New Turán Exponents for Two Extremal Hypergraph Problems
- A Ramsey variant of the Brown-Erdős-Sós conjecture
- Degenerate Turán densities of sparse hypergraphs
- Sparse hypergraphs: new bounds and constructions
- Singleton-type bounds for list-decoding and list-recovery, and related results
- Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity
- Triple systems with no three triples spanning at most five points
- On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
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)