Video Lectures

Separate tags with a comma.
The chromatic number \(k(G)\) of a graph \(G\) is always at least the size of its largest clique (denoted by \(w(G)\)), and there are graphs with \(w(G)=2\) and \(k(G)\) arbitrarily large. On the other hand, the perfect graph theorem asserts that if...

Toy Models

Tadashi Tokieda
Do you want to come see some toys? "Toy" here has a special sense: an object of everyday life which can be found or made in minutes, yet which, if played with imaginatively, reveals a behavior that sets mathematicians and physicists thinking for...