The full automorphism groups of general position graphs

Publication date 29 November 2023

Abstract: Let

S

be a non-empty finite set. A flag of

S

is a set

f

of non-empty proper subsets of

S

such that

X s u b s e t e q Y

or

Y s u b s e t e q X

for all

X, Y i n f

. The set

| X | : X i n f

is called the type of

f

. Two flags

f

and

f^{'}

are in general position with respect to

S

if

X c a p Y = e m p t y s e t

or

X c u p Y = S

for all

X i n f

and

Y i n f^{'}

. For a fixed type

T

, Klaus Metsch defined the general position graph

G a m m a (S, T)

whose vertices are the flags of

S

of type

T

with two vertices being adjacent when the corresponding flags are in general position. In this paper, we characterize the full automorphism groups of

G a m m a (S, T)

in the case that

| T | = 2

. In particular, we solve an open problem proposed by Klaus Metsch.

Recommendations

Cites work

Cited in

(1)

This page was built for publication: The full automorphism groups of general position graphs