The full automorphism groups of general position graphs
Group Theory
2023-08-21 v1 Combinatorics
Abstract
Let be a non-empty finite set. A flag of is a set of non-empty proper subsets of such that or for all . The set is called the type of . Two flags and are in general position with respect to if or for all and . For a fixed type , Klaus Metsch defined the general position graph whose vertices are the flags of of type with two vertices being adjacent when the corresponding flags are in general position. In this paper, we characterize the full automorphism groups of in the case that . In particular, we solve an open problem proposed by Klaus Metsch.
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