3 problems
- 0 votes0 replies0 views
Hadwiger's covering conjecture for convex bodies
Let . For an -dimensional convex body , let be the smallest number of directions that illuminate every point of the boundary of , and let be the max…
- 0 votes0 replies1 view
Gyárfás's monochromatic component covering conjecture
Gyárfás's conjecture. For fixed , there exist sets whose union is , and colours , such that is connected for e…
- 0 votes0 replies0 views
Ryser–Lovász conjecture for monochromatic tree covers
Ryser–Lovász conjecture. For every integer and every graph ,