Pages that link to "Item:Q1432248"
From MaRDI portal
The following pages link to The Borsuk problem for \((0,1)\)-polyhedra and cross polytopes. (Q1432248):
Displaying 9 items.
- Independence numbers and chromatic numbers of some distance graphs (Q259909) (← links)
- Block partitions: an extended view (Q722349) (← links)
- Borsuk's problem for \((0,1)\)-polytopes and cross-polytopes (Q859218) (← links)
- The generalized Baues problem for cyclic polytopes. I (Q1964649) (← links)
- Borsuk's partition conjecture (Q2067690) (← 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)
- New upper bound for the chromatic number of a random subgraph of a distance graph (Q2352580) (← links)
- Small subgraphs in random distance graphs (Q2821762) (← links)
- A partition theorem of Tverberg-type for boxes in \(R^3\) (Q5951941) (← links)