Pages that link to "Item:Q879166"
From MaRDI portal
The following pages link to On an extremal hypergraph problem of Brown, Erdős and Sós (Q879166):
Displaying 34 items.
- Economical extremal hypergraphs for the Erdős-Selfridge theorem (Q297937) (← links)
- Small cores in 3-uniform hypergraphs (Q345139) (← links)
- Nearly complete graphs decomposable into large induced matchings and their applications (Q363228) (← links)
- Uniform hypergraphs containing no grids (Q390731) (← links)
- An extension of the Ruzsa-Szemerédi theorem (Q558315) (← links)
- The asymptotic induced matching number of hypergraphs: balanced binary strings (Q783062) (← links)
- The maximum size of hypergraphs without generalized 4-cycles (Q1024366) (← links)
- On extremal problems concerning the traces of sets (Q2037157) (← links)
- Hypergraph based Berge hypergraphs (Q2062896) (← links)
- A new bound for the Brown-Erdős-Sós problem (Q2101162) (← links)
- Sparse hypergraphs: new bounds and constructions (Q2222044) (← links)
- Degenerate Turán densities of sparse hypergraphs (Q2306000) (← links)
- The Brown-Erdős-Sós conjecture in finite abelian groups (Q2309563) (← links)
- Turán numbers and batch codes (Q2345596) (← links)
- On a Turán-type hypergraph problem of Brown, Erdős and T. Sós (Q2566157) (← links)
- 2-cancellative hypergraphs and codes (Q2883859) (← links)
- Extremal problems concerning transformations of the edges of the complete hypergraphs (Q3027050) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Isomorphic subgraphs in a graph (Q3481741) (← links)
- A Ramsey variant of the Brown–Erdős–Sós conjecture (Q5021660) (← links)
- The Extremal Number of Surfaces (Q5102299) (← links)
- Sparse Hypergraphs with Applications to Coding Theory (Q5130902) (← links)
- New Turán Exponents for Two Extremal Hypergraph Problems (Q5138977) (← links)
- On unavoidable hypergraphs (Q5203064) (← links)
- Triple systems with no three triples spanning at most five points (Q5229522) (← links)
- Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169) (← links)
- Some extremal problems on \(r\)-graphs (Q5672676) (← links)
- Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques (Q5886100) (← links)
- Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity (Q6046820) (← links)
- Approximate Steiner (<i>r</i> − 1, <i>r</i>, <i>n</i>)‐systems without three blocks on <i>r</i> + 2 points (Q6185555) (← links)
- Singleton-type bounds for list-decoding and list-recovery, and related results (Q6187335) (← links)
- Local-vs-global combinatorics (Q6198642) (← links)
- On the \((6,4)\)-problem of Brown, Erdős, and Sós (Q6562822) (← links)
- Turán numbers of \(r\)-graphs on \(r + 1\) vertices (Q6615752) (← links)
