Pages that link to "Item:Q650424"
From MaRDI portal
The following pages link to New lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^{n}\) (Q650424):
Displaying 3 items.
- On the measurable chromatic number of a space of dimension \(n \leq 24\) (Q265996) (← links)
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors (Q1689038) (← links)
- New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs (Q2342346) (← links)
