The following pages link to Forbidding just one intersection (Q1062676):
Displaying 14 items.
- Paths in Hypergraphs: A Rescaling Phenomenon (Q5244124) (← links)
- Hypergraphs without non-trivial intersecting subgraphs (Q5886354) (← links)
- Independent sets in hypergraphs omitting an intersection (Q6052482) (← links)
- Generalized Turán results for intersecting cliques (Q6056423) (← links)
- Extremal Problems for Hypergraph Blowups of Trees (Q6057807) (← links)
- Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs (Q6081575) (← links)
- Integer sequences without singleton intersection (Q6098042) (← links)
- Independence numbers of Johnson-type graphs (Q6115445) (← links)
- Forbidden intersections for codes (Q6139795) (← links)
- A short note on supersaturation for oddtown and eventown (Q6157418) (← links)
- Lower bound on the minimum number of edges in subgraphs of Johnson graphs (Q6173476) (← links)
- Graph-codes (Q6189687) (← links)
- Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs (Q6568850) (← links)
- On the size of maximal binary codes with 2, 3, and 4 distances (Q6615496) (← links)
