Avi Wigderson and László Lovász won for their work developing complexity theory and graph theory, respectively, and for connecting the two fields. When Avi Wigderson and László Lovász began their ...
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 ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback