Babai's talks sketch a proof that shows that the graph isomorphism problem — determining whether two graphs are the same — can be solved much more quickly than was previously known.

Mechanism and Machine Theory (2023). [2] An efficient approach of graph isomorphism identification using loop theory and hopfield neural networks. Multimedia Tools and Applications (2023).

But already in 1980, another classical theorem—the Babai-Erdős-Selkow theorem—showed that almost all graphs can be relabeled to make easy isomorphism testing possible.

This course examines the basic concepts and techniques of graph theory. The topics to be covered are: fundamental concepts, connectivity and matchings, colourings, extremal problems. Optional topics ...

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also ...

To learn more about the graph isomorphism problem, read Erica Klarreich’s 2015 article “Landmark Algorithm Breaks 30-Year Impasse,” and her January 5 blog post, “Complexity Theory Problem Strikes Back ...

Abstractions blog Complexity Theory Problem Strikes Back The legendary graph isomorphism problem may be harder than a 2015 result seemed to suggest. Lucy Reading-Ikkanda for Quanta Magazine The ...