A graph theoretic characterization of the classical generalized hexagon on $364$ vertices
Hui Zhou

TL;DR
This paper characterizes a specific class of highly symmetric graphs related to the classical generalized hexagon, providing a graph-theoretic perspective on its structure and classification.
Contribution
It offers a new graph-theoretic characterization of the classical generalized hexagon on 364 vertices, connecting it to 2-arc-transitive graphs and their covers.
Findings
Identifies the classical generalized hexagon as a unique 2-arc-transitive graph of order 728.
Classifies certain 2-arc-transitive graphs as either the known hexagon or covers of smaller transitive graphs.
Provides a characterization linking graph symmetry properties to geometric structures.
Abstract
A tetravalent -arc-transitive graph of order is either the known -arc-transitive incidence graph of the classical generalized hexagon or a normal cover of a -transitive graph of order denoted or in the list of Poto\v{c}nik.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Advanced Graph Theory Research
