Explores the uniqueness of trees, automorphism groups, Cayley-Abels graphs, and constructing vertex-transitive subgroups with prescribed local actions.
Explores the equivalence between maximum flow and minimum cut in network theory, demonstrating its applications through examples and edge-disjoint paths.