The comparability graph of a modular lattice (Q1307445): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s004930050039 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2030338173 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:08, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The comparability graph of a modular lattice |
scientific article |
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
