The comparability graph of a modular lattice (Q1307445)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1355181
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The comparability graph of a modular lattice |
scientific article; zbMATH DE number 1355181 |
Statements
The comparability graph of a modular lattice (English)
0 references
31 October 1999
0 references
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.
0 references
modular lattice
0 references
comparability graph
0 references
Cohen-Macaulay partially ordered set
0 references
Möbius function
0 references
fundamental chains
0 references
0.8752089142799377
0 references
0.7819405198097229
0 references
0.7789807319641113
0 references
0.7432092428207397
0 references
