Constructions of S-lattices

DOI10.1007/BF00418653MaRDI QIDQ1176977zbMATH OpenOpenAlexFDO

Authors Eva Gedeonová

Publication date 25 June 1992

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00418653

zbMATH Keywords

covering graphslattices

Mathematics Subject Classification ID

Graph theory (05C99) Combinatorics of partially ordered sets (06A07) Lattices (06B99)

Review text

There is given a construction of lattices whose covering graphs can be oriented as a graded order with bottom \(v\) for any vertex \(v\) in the lattice.

Cites work

• A Simple Solution to the Word Problem for Lattices
• scientific article; zbMATH DE number 3613103 (Why is no real title available?)
• Path length in the covering graph of a lattice

Cited in

(4)

• Constructions of representations of \(\text{o}(2n+1,{\mathbb C})\) that imply Molev and Reiner-Stanton lattices are strongly Sperner
• A construction of integral lattices
• scientific article; zbMATH DE number 4115427 (Why is no real title available?)
• Some New Lattice Constructions in High R. E. Degrees

This page was built for publication: Constructions of \(S\)-lattices

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