Hidden Irregularity Versus Hidden Structure: The Emergence of the Johnson Graphs

on YouTube ↗44m

" summary

Laszlo Babai examines how Johnson graphs arise in the context of distinguishing hidden irregularity from hidden structure; he discusses the role of Johnson graphs as emergent combinatorial objects and analyzes their relevance to problems in the structure-vs-randomness paradigm, using graph-theoretic and combinatorial methods.

AI-written summary · about

" chapters (9)

1. 0:00Intro
2. 0:42So for semiregular bipartite graphs
3. 6:36Iwins, symmetry defect for bipartite graphs
4. 15:34So for bipartite graphs: imprimitive case
5. 20:14So for bipartite graphs: UPCC case
6. 24:22Neighborhood hypergraph in bipartite graph
7. 35:03Design Lemma: the algorithm
8. 35:52Hidden irregularity or ...?
9. 37:29Paradoxes of Graph Isomorphism