One powerful way to do this is through a routine called slow reveal graphs.

The 2-domination number γ₂(G) of a graph G is the minimum cardinality of a set S ⊆ V(G) such that every vertex from V(G) \ S is adjacent to at least two vertices in S. The annihilation number a(G) is ...

Mathematical truths are often born of the conflict between order and disorder. Mathematicians discover patterns, and, to better understand the mysterious forces at play, they look for countervailing ...

These past few months have not been kind to any of us. The ripples caused by the COVID-19 crisis are felt far and wide, and the world's economies have taken a staggering blow. As with most things in ...

Anthony Bonato does not work for, consult, own shares in or receive funding from any company or organization that would benefit from this article, and has disclosed no relevant affiliations beyond ...