In 1950 Edward Nelson, then a student at the University of Chicago, asked the kind of deceptively simple question that can give mathematicians fits for decades. Imagine, he said, a graph — a ...

The authors do not work for, consult, own shares in or receive funding from any company or organization that would benefit from this article, and have disclosed no relevant affiliations beyond their ...

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 ...

Taiwanese Journal of Mathematics, Vol. 24, No. 4 (August 2020), pp. 785-815 (31 pages) In 2011, Caro et al. introduced the monochromatic connection of graphs. An edge-coloring of a connected graph G ...

Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...