English

Finite $3$-connected homogeneous graphs

Combinatorics 2022-10-20 v3

Abstract

A finite graph \G\G is said to be {\em (G,3)(G,3)-((connected)) homogeneous} if every isomorphism between any two isomorphic (connected) subgraphs of order at most 33 extends to an automorphism gGg\in G of the graph, where GG is a group of automorphisms of the graph. In 1985, Cameron and Macpherson determined all finite (G,3)(G, 3)-homogeneous graphs. In this paper, we develop a method for characterising (G,3)(G,3)-connected homogeneous graphs. It is shown that for a finite (G,3)(G,3)-connected homogeneous graph \G=(V,E)\G=(V, E), either Gv\G(v)G_v^{\G(v)} is 22--transitive or Gv\G(v)G_v^{\G(v)} is of rank 33 and \G\G has girth 33, and that the class of finite (G,3)(G,3)-connected homogeneous graphs is closed under taking normal quotients. This leads us to study graphs where GG is quasiprimitive on VV. We determine the possible quasiprimitive types for GG in this case and give new constructions of examples for some possible types.

Keywords

Cite

@article{arxiv.1810.01535,
  title  = {Finite $3$-connected homogeneous graphs},
  author = {Cai Heng Li and Jin-Xin Zhou},
  journal= {arXiv preprint arXiv:1810.01535},
  year   = {2022}
}
R2 v1 2026-06-23T04:26:39.191Z