Transitive decompositions of graphs and their links with geometry and origami
| dc.creator | Pearce, Geoffrey | |
| dc.date | 2007-06-17 | |
| dc.date.accessioned | 2026-07-07T08:10:42Z | |
| dc.date.available | 2026-07-07T08:10:42Z | |
| dc.description | A transitive decomposition of a graph is a partition of the edge or arc set giving a set of subgraphs which are preserved and permuted transitively by a group of automorphisms of the graph. In this paper we give some background to the study of transitive decompositions and highlight a connection with partial linear spaces. We then describe a simple method for constructing transitive decompositions using graph quotients, and we show how this may be used in an application to modular origami. | |
| dc.identifier | https://arxiv.org/abs/0706.2453 | |
| dc.identifier | http://arxiv.org/abs/0706.2453 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/131894 | |
| dc.subject | Combinatorics | |
| dc.subject | Group Theory | |
| dc.title | Transitive decompositions of graphs and their links with geometry and origami | |
| dc.type | text |