Automorphisms of infinite Johnson graphs

Abstract: We consider the {it infinite Johnson graph}

J_{i n f t y}

whose vertex set consists of all subsets

X s u b s e t m a t h b b N

satisfying

| X | = | m a t h b b N s e t m i n u s X | = i n f t y

and whose edges are pairs of such subsets

X, Y

satisfying

| X s e t m i n u s Y | = | Y s e t m i n u s X | = 1

. An automorphism of

J_{i n f t y}

is said to be {it regular} if it is induced by a permutation on

m a t h b b N

or it is the composition of the automorphism induced by a permutation on

m a t h b b N

and the automorphism

X o m a t h b b N s e t m i n u s X

. The graph

J_{i n f t y}

admits non-regular automorphisms. Our first result states that the restriction of every automorphism of

J_{i n f t y}

to any connected component (

J_{i n f t y}

is not connected) coincides with the restriction of a regular automorphism. The second result is a characterization of regular automorphisms of

J_{i n f t y}

as order preserving and order reversing bijective transformations of the vertex set of

J_{i n f t y}

(the vertex set is partially ordered by the inclusion relation). As an application, we describe automorphisms of the associated {it infinite Kneser graph}.

Recommendations

Cited in

(5)

This page was built for publication: Automorphisms of infinite Johnson graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1939593)