Graph learning and topology inference techniques aim to reconstruct network structures from observational data by treating measurements as signals defined on unknown graphs. These approaches draw on ...

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

Graph decomposition encompasses a suite of methods by which the edges of a graph are partitioned into subgraphs that satisfy prescribed properties or isomorphism classes. Central to this field are ...