Pages that link to "Item:Q1689038"
From MaRDI portal
The following pages link to Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors (Q1689038):
Displaying 16 items.
- Diversity of uniform intersecting families (Q1671747) (← links)
- On the chromatic numbers of some distance graphs (Q1709876) (← links)
- On the \(d\)-cluster generalization of Erdős-Ko-Rado (Q2037168) (← links)
- Bounds on Borsuk numbers in distance graphs of a special type (Q2044127) (← links)
- A generalization of Kneser graphs (Q2191979) (← links)
- On dividing sets into parts of smaller diameter (Q2243826) (← links)
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2313252) (← links)
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles (Q2314097) (← links)
- Degree versions of theorems on intersecting families via stability (Q2326331) (← links)
- Correction to the article: ``Intersection theorems for \((0,\pm1)\)-vectors and \(s\)-cross-intersecting families'' (Q2332800) (← links)
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241) (← links)
- Binary scalar products (Q2673478) (← links)
- (Q5148147) (← links)
- Sharp threshold for the Erdős–Ko–Rado theorem (Q6077048) (← links)
- Independence numbers of Johnson-type graphs (Q6115445) (← links)
- Intersection theorems for \((- 1, 0, 1)\)-vectors (Q6181997) (← links)
