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

Graph partitioning and bisection represent fundamental questions in combinatorial optimisation, concerned with dividing the vertices of a graph into disjoint subsets while balancing size constraints ...

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