2012/01/21 by Mariusz Grech, Grech, Mariusz, Andrzej Kisielewicz +1
Computer Science · Engineering · Mathematics · #05C15 #05C70 #05E18 #20B25 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems #math.CO #msc:05C15 #msc:05C70 #msc:05E18 #msc:20B25
paper · pdf · doi:10.48550/arxiv.1201.4464
13 pages
arxiv created 2012/01/21 · openalex publication_date 2012/01/21 · arxiv updated 2012/01/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we describe all edge-colored graphs that are fully symmetric with respect to colors and transitive on every set of edges of the same color. They correspond to fully symmetric homogeneous factorizations of complete graphs. Our description completes the work done in our previous paper, where we have shown, in particular, that there are no such graphs with more than 5 colors. Using some recent results, with a help of computer, we settle all the cases that was left open in the previous paper.