Tag Archives: Boolean representable simplicial complexes

All kinds of mathematics, 2

Day 2 began with Gordon Royle telling us how he had almost completely finished the proof that roots of chromatic polynomials of planar graphs are dense in the interval (3,4). Now, on this topic, only the Birkhoff–Lewis conjecture that there … Continue reading

Posted in events | Tagged , , , , , , , | Leave a comment