The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Graph isomorphism of ordered sets”

Graph automorphisms and cells of lattices

Ján Jakubík (2003)

Czechoslovak Mathematical Journal

Similarity:

In this paper we apply the notion of cell of a lattice for dealing with graph automorphisms of lattices (in connection with a problem proposed by G. Birkhoff).

Characterization of Birkhoff’s Conditions by Means of Cover-Preserving and Partially Cover-Preserving Sublattices

Marcin Łazarz (2016)

Bulletin of the Section of Logic

Similarity:

In the paper we investigate Birkhoff’s conditions (Bi) and (Bi*). We prove that a discrete lattice L satisfies the condition (Bi) (the condition (Bi*)) if and only if L is a 4-cell lattice not containing a cover-preserving sublattice isomorphic to the lattice S*7 (the lattice S7). As a corollary we obtain a well known result of J. Jakub´ık from [6]. Furthermore, lattices S7 and S*7 are considered as so-called partially cover-preserving sublattices of a given lattice L, S7 ≪ L and S7...