Algebraic Graph Theory Seminar - Robert Jajcay (11.10.2019)
Friday 11.10.2019 at 13:30, Lecture room XI
By: Martin Mačaj
Applications of r-regular families of permutations in graph packing problems
Our ultimate goal is to prove or disprove the possibility to partition the edges of a complete graph on 50 vertices into seven disjoint copies of the Hoffman-Singleton graph. One of the possible tools to be used toward this goal might be the relatively new concept of r-regular families of graph automorphisms. We will review previous uses of r-regular families in proving similar results and address the possible uses with regard to the above packing problem.