Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-19T01:48:02.021Z Has data issue: false hasContentIssue false

Undirected Graphs Realizable as Graphs of Modular Lattices

Published online by Cambridge University Press:  20 November 2018

Laurence R. Alvarez*
Affiliation:
University of the South, Sewanee, Tennessee
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

If (L, ≥) is a lattice or partial order we may think of its Hesse diagram as a directed graph, G, containing the single edge E(c, d) if and only if c covers d in (L, ≥). This graph we shall call the graph of (L, ≥). Strictly speaking it is the basis graph of (L, ≥) with the loops at each vertex removed; see (3, p. 170).

We shall say that an undirected graph Gu can be realized as the graph of a (modular) (distributive) lattice if and only if there is some (modular) (distributive) lattice whose graph has Gu as its associated undirected graph.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1965