A 2004 Graph Conjecture Finally Gets Its Sandwich

In 2004, two mathematicians hypothesized a powerful kind of sandwich. They were studying graphs — collections of points called vertices joined by lines called edges — and the graphs in question might represent anything from social groups to the internet to neurons in the brain.

The hoped-for result concerned properties of one type of graph that, in the framing Quanta gives it, is ubiquitous across mathematics and computer science. A sandwich in this setting means bracketing a hard object between two easier ones: show that your graph sits between a pair of graphs whose structure you already understand, and the properties you want come along with the bracketing.

That is the appeal of the technique. You don't attack the graph directly; you prove it can't escape a container built from things you already know.