Pages that link to "Item:Q2566157"
From MaRDI portal
The following pages link to On a Turán-type hypergraph problem of Brown, Erdős and T. Sós (Q2566157):
Displaying 12 items.
- Uniform hypergraphs containing no grids (Q390731) (← links)
- Note on the 3-graph counting Lemma (Q941395) (← links)
- Turán and Ramsey numbers in linear triple systems. II (Q2092409) (← 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)
- Turán numbers and batch codes (Q2345596) (← links)
- 2-Cancellative Hypergraphs and Codes (Q2883859) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Sparse Hypergraphs with Applications to Coding Theory (Q5130902) (← 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)
