Enumerating Two-Orbit Graphs
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914437398528000 |
|---|---|
| author | Seka, David Szeider, Stefan |
| author_facet | Seka, David Szeider, Stefan |
| contents | We present an approach to enumerate graphs whose automorphism group has exactly two orbits. Our method exploits the observation that we can enumerate all graphs whose automorphism group contains a given this permutation group. We obtain the relevant groups via Goursat's lemma. In order to scale the enumeration, we employ additional optimizations that prune irrelevant groups. In total, we enumerate, for the first time, all connected two-orbit graphs of up to 27 vertices, totaling 10,094,721 graphs, pushing the state of the art well beyond what direct enumeration methods can achieve. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_00898 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Enumerating Two-Orbit Graphs Seka, David Szeider, Stefan Discrete Mathematics Combinatorics We present an approach to enumerate graphs whose automorphism group has exactly two orbits. Our method exploits the observation that we can enumerate all graphs whose automorphism group contains a given this permutation group. We obtain the relevant groups via Goursat's lemma. In order to scale the enumeration, we employ additional optimizations that prune irrelevant groups. In total, we enumerate, for the first time, all connected two-orbit graphs of up to 27 vertices, totaling 10,094,721 graphs, pushing the state of the art well beyond what direct enumeration methods can achieve. |
| title | Enumerating Two-Orbit Graphs |
| topic | Discrete Mathematics Combinatorics |
| url | https://arxiv.org/abs/2604.00898 |