Pages that link to "Item:Q390731"
From MaRDI portal
The following pages link to Uniform hypergraphs containing no grids (Q390731):
Displayed 17 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- The linear Turán number of small triple systems or why is the wicket interesting? (Q2166284) (← links)
- On a conjecture of Erdős on locally sparse Steiner triple systems (Q2216922) (← links)
- Sparse hypergraphs: new bounds and constructions (Q2222044) (← links)
- Turán and Ramsey numbers in linear triple systems (Q2222956) (← links)
- Degenerate Turán densities of sparse hypergraphs (Q2306000) (← links)
- Identifying defective sets using queries of small size (Q2411609) (← links)
- On positive hypergraphs (Q2674558) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A Ramsey variant of the Brown–Erdős–Sós conjecture (Q5021660) (← links)
- Sparse Hypergraphs with Applications to Coding Theory (Q5130902) (← links)
- New Turán Exponents for Two Extremal Hypergraph Problems (Q5138977) (← links)
- Constructing dense grid-free linear $3$-graphs (Q5164032) (← links)
- Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169) (← links)
- Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity (Q6046820) (← links)
- The Turán number of the grid (Q6176592) (← links)
- Local-vs-global combinatorics (Q6198642) (← links)