Abstract: Graphs are ubiquitous in modern applications---including some very large graphs. This leads one to wonder, "How can we understand such large graphs?" One prevalent idea is to observe them ...
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. Click to tell Google to prioritize ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results