Symmetric Graphs and their Quotients
Combinatorics
2013-06-21 v1
Abstract
In this expository paper we describe a group theoretic characterization of arc-transitive graphs and their quotients. When passing from a symmetric graph to its quotient, much information is lost, but some of this information may be recovered from a certain combinatorial design on the blocks, as well as a bipartite graph between the blocks. We address the "extention problem" which asks, when is this additional information sufficient to recover the original graph?
Keywords
Cite
@article{arxiv.1306.4798,
title = {Symmetric Graphs and their Quotients},
author = {Robin Langer},
journal= {arXiv preprint arXiv:1306.4798},
year = {2013}
}
Comments
This is my honours thesis from 2005, its a bit of a mess