A proof of the polycirculant conjecture
| dc.creator | Mwambene, Eric | |
| dc.date | 2005-06-30 | |
| dc.date.accessioned | 2026-07-07T05:21:16Z | |
| dc.date.available | 2026-07-07T05:21:16Z | |
| dc.description | This paper presents a solution of the polycirculant conjecture which states that every vertex-transitive graph G has an automorphism that permutes the vertices in cycles of the same length. This is done by identifying vertex-transitive graphs as coset graphs. For a coset graph H, an equivalence relation $\sim$ is defined on the vertices of cosets with classes as double cosets of the stabiliser and any other proper subgroup A' of a transitive group A of G. Induced left translations of elements of the subgroup A' are semi-regular since they preserve these double cosets and acts regularly on each of them. The coset graph is equivalent to G by a theorem of Sabidussi. | |
| dc.description | 6 pages | |
| dc.identifier | https://arxiv.org/abs/math/0506617 | |
| dc.identifier | http://arxiv.org/abs/math/0506617 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/75629 | |
| dc.subject | Combinatorics | |
| dc.subject | Group Theory | |
| dc.subject | 05C25;20B25;05E15;20F65 | |
| dc.title | A proof of the polycirculant conjecture | |
| dc.type | text |