Pages that link to "Item:Q1681899"
From MaRDI portal
The following pages link to Intersection theorems for \(\{0,\pm1\}\)-vectors and \(s\)-cross-intersecting families (Q1681899):
Displaying 15 items.
- An extremal problem on crossing vectors. (Q458279) (← links)
- An exact result for \((0, \pm 1)\)-vectors (Q723491) (← links)
- Some intersection theorems (Q1200282) (← links)
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors (Q1689038) (← links)
- Families of vector spaces with \(r\)-wise \(\mathcal{L}\)-intersections (Q1699549) (← links)
- Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations (Q2133641) (← links)
- A generalization of Kneser graphs (Q2191979) (← links)
- Analogues of Milner's theorem for families without long chains and of vector spaces (Q2225460) (← links)
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles (Q2314097) (← links)
- Intersection theorems under dimension constraints (Q2368655) (← links)
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241) (← links)
- Erdős-Ko-Rado theorems in certain semilattices (Q2441154) (← links)
- (Q3972007) (← links)
- A cross-intersection theorem for vector spaces based on semidefinite programming (Q5409116) (← links)
- On the chromatic numbers of small-dimensional Euclidean spaces (Q5891225) (← links)
