The comparability graph of a modular lattice

DOI10.1007/S004930050039MaRDI QIDQ1307445zbMATH OpenOpenAlexFDO

Authors Takayuki Hibi

Publication date 31 October 1999

Published in Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

Cohen-Macaulay partially ordered setcomparability graphfundamental chainsmodular latticeMöbius function

Mathematics Subject Classification ID

Connectivity (05C40) Algebraic aspects of posets (06A11) Modular lattices, Desarguesian lattices (06C05)

Review text

The author shows that the comparability graph of a finite lattice \(L\) of rank \(d-1\) \((\geq 3)\) is \(d\)-connected if there is an interval \([x,y] \subset L\) of rank 3 with \(\mu_L (x,y) = 0\) (\(\mu_L\) is the Möbius function of \(L\)). He uses fundamental chains of Cohen-Macaulay partially ordered sets.

Recommendations

• Comparability graphs of lattices
• Chains of modular elements and lattice connectivity
• Incomparability graphs of lattices
• The comaximal graph of a lattice

Cited in

(5)

• Posets that locally resemble distributive lattices. An extension of Stanley's theorem (with connections to buildings and diagram geometries)
• Comparability graphs of lattices
• scientific article; zbMATH DE number 3922715 (Why is no real title available?)
• On planar and dismantlable lattices
• Vertex connectivity of chordal graphs

This page was built for publication: The comparability graph of a modular lattice

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