Planar subgroup lattices. (Q2491955)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Planar subgroup lattices.
scientific article

    Statements

    Planar subgroup lattices. (English)
    0 references
    0 references
    31 May 2006
    0 references
    A lattice is called planar if its Hasse diagram (in the plane) has the property that no two line segments intersect [see \textit{D. Kelly} and \textit{I. Rival}, Can. J. Math. 27, 636-665 (1975; Zbl 0312.06003)]. In the present paper there are characterized the finite groups whose subgroup lattice is planar. The key result used is the well-known Kuratowski theorem, which reduces the problem to the study of subdivisions of the Kuratowski graphs \(K_{3,3}\) and \(K_5\) in the covering graphs of the subgroup lattice of a finite group. One obtains that such a graph is planar if and only if it contains no subdivision of \(K_{3,3}\) (see Theorem C).
    0 references
    planar subgroup lattices
    0 references
    Hasse diagrams
    0 references
    finite groups
    0 references
    planar Hasse graphs
    0 references
    cyclic groups
    0 references
    planar lattices
    0 references
    planar graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references