pith. machine review for the scientific record. sign in

arxiv: 2603.04935 · v2 · submitted 2026-03-05 · 🧮 math.CO

Recognition: 2 theorem links

· Lean Theorem

Geodesic-transitive graphs with large diameter

Pei Ce Hua
Authors on Pith no claims yet

Pith reviewed 2026-05-15 16:59 UTC · model grok-4.3

classification 🧮 math.CO MSC 05C2505C12
keywords distance-transitive graphsgeodesic-transitive graphsgraph diametersymmetric graphspolar Grassmann graphsfinite graphs
0
0 comments X

The pith

Distance-transitive graphs with diameter over 4 are geodesic-transitive apart from a small number of exceptions.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper examines the known finite distance-transitive graphs and notes a pattern based on their diameter. For those with diameter larger than 4, they turn out to be geodesic-transitive in nearly all cases. This means their automorphism groups act transitively not only on pairs of vertices at given distances but also on the shortest paths connecting them. The observation relies on the current state of the classification of such graphs. The authors also construct examples where distance-transitivity does not imply geodesic-transitivity, mainly for diameter 3.

Core claim

Apart from a small finite number of exceptions, all known finite distance-transitive graphs with diameter larger than 4 are geodesic-transitive. Their geodesics exhibit a clear, often geometric structure. The paper also provides explicit examples of distance-transitive graphs that are not geodesic-transitive, including two infinite families with diameter 3 and some sporadic ones with diameters 3, 4, or 7, and extends the analysis to polar Grassmann graphs by describing their geodesics explicitly.

What carries the argument

Geodesic-transitivity, which requires the automorphism group to act transitively on the set of geodesics between vertices at a given distance.

Load-bearing premise

The nearly complete classification of finite distance-transitive graphs accurately captures all examples with diameter greater than 4.

What would settle it

Discovery of a new distance-transitive graph with diameter at least 5 that fails to be geodesic-transitive.

read the original abstract

We review the nearly complete classification project for finite distance-transitive graphs and compile a list of all known graphs. Interestingly, we find that those graphs with diameter larger than 4, apart from a small finite number of exceptions, are geodesic-transitive. Their geodesics exhibit a clear (often geometric) structure. On the other hand, we provide examples of graphs that are distance-transitive but not geodesic-transitive, including two infinite families with diameter 3 and a few sporadic ones with diameter 3, 4 or 7. In the last section, we extend our investigation to polar Grassmann graphs and provide an explicit description of their geodesics.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The manuscript reviews the nearly complete classification project for finite distance-transitive graphs and compiles a list of all known examples. It observes that, apart from a small finite number of exceptions, all such graphs with diameter larger than 4 are geodesic-transitive and that their geodesics exhibit a clear (often geometric) structure. The paper supplies examples of distance-transitive graphs that fail to be geodesic-transitive, including two infinite families of diameter 3 and a few sporadic examples of diameters 3, 4 or 7. In the final section it extends the investigation to polar Grassmann graphs and gives an explicit description of their geodesics.

Significance. If the underlying classification is accepted as sufficiently complete, the compilation and the diameter-based observation provide a useful structural insight into highly symmetric graphs: large-diameter distance-transitive graphs tend to have geometrically organized geodesics. The explicit geodesic description for polar Grassmann graphs adds concrete value, while the counter-examples with smaller diameters help delineate where the phenomenon fails.

major comments (1)
  1. The central observational claim (graphs of diameter >4 are geodesic-transitive apart from finitely many exceptions) rests entirely on the external classification being complete enough to have captured all exceptions. The manuscript describes the classification as “nearly complete” but supplies no independent argument, bound, or exhaustive search that would rule out the existence of an undiscovered distance-transitive graph of diameter 5 or larger that is not geodesic-transitive. This makes the qualifier “apart from a small finite number of exceptions” conditional rather than unconditional.
minor comments (2)
  1. The two infinite families of diameter-3 counter-examples are mentioned but not constructed in the text; a short, self-contained description or reference to their explicit adjacency rules would improve readability.
  2. In the polar-Grassmann section, the geodesic description assumes familiarity with the underlying geometry; adding a brief reminder of the vertex set and adjacency relation would make the section more accessible.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and constructive feedback on the manuscript. We address the single major comment below.

read point-by-point responses

  1. Referee: The central observational claim (graphs of diameter >4 are geodesic-transitive apart from finitely many exceptions) rests entirely on the external classification being complete enough to have captured all exceptions. The manuscript describes the classification as “nearly complete” but supplies no independent argument, bound, or exhaustive search that would rule out the existence of an undiscovered distance-transitive graph of diameter 5 or larger that is not geodesic-transitive. This makes the qualifier “apart from a small finite number of exceptions” conditional rather than unconditional.

    Authors: We agree that the central claim is observational and rests on the existing classification results for finite distance-transitive graphs. The manuscript compiles all known examples from the literature and notes the pattern that holds for those with diameter larger than 4. The phrasing “nearly complete” follows standard terminology in the field, and the qualifier “apart from a small finite number of exceptions” accurately reflects that only a handful of counterexamples (all of small diameter) are currently known. The paper does not claim to prove completeness of the classification or to rule out hypothetical undiscovered graphs; its contribution lies in the compilation, the explicit counterexamples, and the geodesic descriptions for polar Grassmann graphs. Providing an independent verification or bound would require a separate, substantial research effort outside the scope of this work. No changes are made to the manuscript on this point. revision: no

Circularity Check

0 steps flagged

Empirical observation from external classification list; no internal reduction to inputs

full rationale

The paper reviews the external 'nearly complete classification project for finite distance-transitive graphs', compiles the known list, and reports an observed pattern for diameter >4. No equations, parameters, or derivations are defined in terms of the target claim. The statement is explicitly an empirical finding from the compiled list of known graphs, with counterexamples supplied for smaller diameters. No self-citation chain, self-definition, or fitted-input renaming is present. The result is therefore self-contained against the external benchmark of the classification project.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the assumption that the prior classification of distance-transitive graphs is nearly complete; this is a domain assumption drawn from the literature rather than derived inside the paper.

axioms (1)
  • standard math Standard definitions of distance-transitive graphs, geodesic-transitive graphs, and diameter in finite undirected graphs
    The paper invokes these established combinatorial notions without re-deriving them.

pith-pipeline@v0.9.0 · 5391 in / 1250 out tokens · 51164 ms · 2026-05-15T16:59:10.884866+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

28 extracted references · 28 canonical work pages

  1. [1]

    Alfuraidan, Antipodal distance-transitive covers with primitive quotient of diam- eter two, Discrete Math

    M.R. Alfuraidan, Antipodal distance-transitive covers with primitive quotient of diam- eter two, Discrete Math. 313 (2013) 2409–2422

    work page 2013

  2. [2]

    29 (2013) 1151–1174

    ——, Bipartite distance-transitive doubles with primitive halved of diameter two, Graphs Combin. 29 (2013) 1151–1174

    work page 2013

  3. [3]

    Alfuraidan, J.I

    M.R. Alfuraidan, J.I. Hall, Smith’s theorem and a characterization of the 6-cube as distance-transitive graph, J. Algebraic Combin. 24 (2006) 195–207

    work page 2006

  4. [4]

    ——, Imprimitive distance-transitive graphs with primitive core of diameter at least 3, Michigan Math. J. 58 (2009) 31-77

    work page 2009

  5. [5]

    Alfuraidan, J.I

    M.R. Alfuraidan, J.I. Hall, A.Laradji, Antipodal covers of distance-transitive gereralized polygons, J. Algebraic Combin. 48 (2018) 607-626

    work page 2018

  6. [6]

    Bannai, Maximal subgroups of low rank of finite symmetric and alternating groups, J

    E. Bannai, Maximal subgroups of low rank of finite symmetric and alternating groups, J. Fac. Sci. Univ. Tokyo Sect. IA Math. 18 (1971/72), 475–486. GEODESIC-TRANSITIVE GRAPHS WITH LARGE DIAMETER 23

    work page 1971

  7. [7]

    van Bon, Finite primitive distance-transitive graphs, European J

    J. van Bon, Finite primitive distance-transitive graphs, European J. Combin. 28 (2007) 517-532

    work page 2007

  8. [8]

    Brouwer, A.M

    A.E. Brouwer, A.M. Cohen, A. Neumaier, Distance-regular Graphs, Springer-Verlag, Berlin, Heidelberg, New York, London, Paris, Tokyo, 1989

    work page 1989

  9. [9]

    Brouwer, H

    A.E. Brouwer, H. Van Maldeghem, Strongly Regular Graphs, Cambridge University Press, 2022

    work page 2022

  10. [10]

    Buekenhout, H

    F. Buekenhout, H. van Maldeghem, Finite distance-transitive generalized polygons, Geom. Dedicata 52 (1994), 41–51

    work page 1994

  11. [11]

    Dieudonn´ e, La g´ eometrie des groupes classiques, Springer, Berlin, 1963

    J. Dieudonn´ e, La g´ eometrie des groupes classiques, Springer, Berlin, 1963

    work page 1963

  12. [12]

    Feng, P.C

    R.Q. Feng, P.C. Hua, A new family of geodesic transitive graphs, Discrete Math. 341 (2018) 2700-2707

    work page 2018

  13. [13]

    Godsil, R.A

    C.D. Godsil, R.A. Liebler, C.E. Praeger, Antipodal distance-transitive covers of com- plete graphs, European J. Combin. 19 (1998) 455–478

    work page 1998

  14. [14]

    Hua, Constructions for geodesic transitive graphs, Ph.D

    P.C. Hua, Constructions for geodesic transitive graphs, Ph.D. Thesis, Peking University, 2020

    work page 2020

  15. [15]

    Ivanov, R.A

    A.A. Ivanov, R.A. Liebler, T. Pentilla, C.E. Praeger, Antipodal distance-transitive cov- ers of complete bipartite graphs, European J. Combin. 18 (1997) 11–23

    work page 1997

  16. [16]

    W. Jin, A. Devillers, C.H. Li, C.E. Praeger, On geodesic transitive graphs, Discrete Math. 338 (2015) 168-173

    work page 2015

  17. [17]

    Kantor, Classification of 2-transitive symmetric designs, Graphs Combin

    W.M. Kantor, Classification of 2-transitive symmetric designs, Graphs Combin. 1 (1985), 165–166

    work page 1985

  18. [18]

    Kantor, R.A

    W.M. Kantor, R.A. Liebler, The rank 3 permutation representations of the finite clas- sical groups, Trans. Amer. Math. Soc. 271 (1) (1982) 1–71

    work page 1982

  19. [19]

    Kwiatkowski, M

    M. Kwiatkowski, M. Pankov, Isometric embeddings of polar Grassmannians and metric characterizations of their apartments, J. Algebraic Combin. 45 no.3 (2017) 777-801

    work page 2017

  20. [20]

    Liebeck, The affine permutation groups of rank three, Proc

    M.W. Liebeck, The affine permutation groups of rank three, Proc. Lond. Math. Soc. (3) 54 (3) (1987) 477–516

    work page 1987

  21. [21]

    Liebeck, J

    M.W. Liebeck, J. Saxl, The finite primitive permutation groups of rank three, Bull. Lond. Math. Soc. 18 (2) (1986) 165–172

    work page 1986

  22. [22]

    Pankov, Grassmannians of Classical Buildings, Algebra and Discrete Math

    M. Pankov, Grassmannians of Classical Buildings, Algebra and Discrete Math. Series

    work page

  23. [23]

    World Scientific, Singapore, 2010

    work page 2010

  24. [24]

    Pankov, On embeddings of Grassmann graphs in polar Grassmann graphs, Linear Algebra Appl

    M. Pankov, On embeddings of Grassmann graphs in polar Grassmann graphs, Linear Algebra Appl. 488 (2016) 184-198

    work page 2016

  25. [25]

    Smith, Primitive and imprimitive graphs, Quart

    D.H. Smith, Primitive and imprimitive graphs, Quart. J. Math. Oxford Ser. (2) 22 (1971), 551–557

    work page 1971

  26. [26]

    Taylor, Two-graphs and doubly transitive groups, J

    D.E. Taylor, Two-graphs and doubly transitive groups, J. Combin. Theory Ser. A 61 (1992), no. 1, 113–122

    work page 1992

  27. [27]

    Tits, Buildings of spherical type and finite BN-pairs, Lecture Notes in Math

    J. Tits, Buildings of spherical type and finite BN-pairs, Lecture Notes in Math. 386, Springer, Berlin, 1974

    work page 1974

  28. [28]

    van Maldeghem, Generalized Polygons, Springer, Basel, Dordrecht, Heidelberg, Lon- don, New York, 1998

    H. van Maldeghem, Generalized Polygons, Springer, Basel, Dordrecht, Heidelberg, Lon- don, New York, 1998. Peice Hua, Shenzhen International Center for Mathematics, Southern Uni- versity of Science and Technology, Shenzhen, 518055, P. R. China Email address:huapc@pku.edu.cn

    work page 1998