A New Recipe Unites Random Graphs, Solving a Decades-Old Sandwich Conjecture
Researchers completed the long-standing 'sandwich' conjecture by showing how to generate a binomial random graph and a regular graph in tandem so that each contains the other; by constructing the two graphs edge-by-edge (and then reversing the process), they derive a meta-theorem letting properties proven for the easier binomial model automatically apply to the harder regular model, streamlining many results in network theory and opening the door to more layered graph constructions.