David Conlon and Asaf Ferber have raised the lower bound for multicolor “Ramsey numbers,” which quantify how big graphs can get before patterns inevitably emerge. “There is no absolute randomness in ...

RESTON, VA—March 9, 2010—Responding to a growing need in the graphic communications industry, momentum is building for GRAPH EXPO 2010's newest show floor feature—News Print, a dedicated newspaper ...

A pair of mathematicians solved a legendary question about the proportion of vertices in a graph with an odd number of connections. “It’s a bit of a surprise, at least for me, that such a combination ...