The Hat Guessing Game is as follows: There are n bears and one demon (who can read the bears' minds), and the bears are each sitting on one vertex of a graph G. The bears close their eyes and the ...
That is, each edge receives two ``half colors'' so that no half color is repeated at a vertex ... anti-blocking pairs of polyhedra, Math. Programming 1 (1971) 168-194. [2] P.D. Seymour, On ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback