English

The full automorphism groups of general position graphs

Group Theory 2023-08-21 v1 Combinatorics

Abstract

Let SS be a non-empty finite set. A flag of SS is a set ff of non-empty proper subsets of SS such that XYX\subseteq Y or YXY\subseteq X for all X,YfX,Y\in f. The set {X:Xf}\{|X|:X\in f\} is called the type of ff. Two flags ff and ff' are in general position with respect to SS if XY=X\cap Y=\emptyset or XY=SX\cup Y=S for all XfX\in f and YfY\in f'. For a fixed type TT, Klaus Metsch defined the general position graph Γ(S,T)\Gamma(S,T) whose vertices are the flags of SS of type TT with two vertices being adjacent when the corresponding flags are in general position. In this paper, we characterize the full automorphism groups of Γ(S,T)\Gamma(S,T) in the case that T=2|T|=2. In particular, we solve an open problem proposed by Klaus Metsch.

Keywords

Cite

@article{arxiv.2307.00546,
  title  = {The full automorphism groups of general position graphs},
  author = {Junyao Pan},
  journal= {arXiv preprint arXiv:2307.00546},
  year   = {2023}
}

Comments

we solve an open problem proposed by Klaus Metsch

R2 v1 2026-06-28T11:20:02.127Z