Pages that link to "Item:Q3372463"
From MaRDI portal
The following pages link to The problems of Borsuk and Grunbaum on lattice polytopes (Q3372463):
Displaying 17 items.
- Independence numbers and chromatic numbers of some distance graphs (Q259909) (← links)
- On the Borsuk and Grünbaum problems for \((0,1)\)- and \((-1,0,1)\)-polytopes in low-dimensional spaces (Q352177) (← links)
- On the stability of the Erdös-Ko-Rado theorem (Q498190) (← links)
- Block partitions: an extended view (Q722349) (← links)
- Hamiltonian paths in distance graphs (Q745636) (← links)
- Borsuk's problem for \((0,1)\)-polytopes and cross-polytopes (Q859218) (← links)
- The Borsuk problem for \((0,1)\)-polyhedra and cross polytopes. (Q1432248) (← links)
- Distance graphs having large chromatic numbers and containing no cliques or cycles of a given size (Q1761033) (← links)
- On the multiple Borsuk numbers of sets (Q2017114) (← 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)
- Open problems from the 2018 Summer Workshop on Lattice Polytopes at Osaka University (Q5195222) (← links)
- Zero-one laws for random graphs with vertices in a Boolean cube (Q5269177) (← links)
- Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii (Q5396969) (← links)
- Systems of representatives (Q5919350) (← links)
