##
**On the covering graph of balanced lattices.**
*(English)*
Zbl 0861.06005

The paper concerns covering graphs of lattices, i.e. their undirected Hasse diagrams. By \(J(L)\) the set of join-irreducible non-zero elements of a lattice \(L\) is denoted, the symbol \(j'\) for \(j\in L\) denotes the unique lower cover of \(j\). A lattice \(L\) of finite length is called strong, if for all \(j\in J(L)\) and \(x\in L\) the inequality \(j\leq x\vee j'\) implies \(j\leq x\). If both \(L\) and its dual lattice are strong, the lattice \(L\) is called balanced.

The main result is the following theorem: Let \(L\) and \(L'\) be graded lattices with graph isomorphic covering graphs. \(L\) is balanced if and only if \(L'\) is balanced. Moreover, if this condition is satisfied, then there are sublattices \(A\) and \(B\) of \(L\) such that \(L\cong A\times B\) and \(L'\cong A^d\times B\). (Here \(A^d\) denotes the lattice dual to \(A\)).

There are two corollaries of this theorem, one of them was proved as a theorem by D. Duffus and I. Rival, the other by J. Jakubík.

The main result is the following theorem: Let \(L\) and \(L'\) be graded lattices with graph isomorphic covering graphs. \(L\) is balanced if and only if \(L'\) is balanced. Moreover, if this condition is satisfied, then there are sublattices \(A\) and \(B\) of \(L\) such that \(L\cong A\times B\) and \(L'\cong A^d\times B\). (Here \(A^d\) denotes the lattice dual to \(A\)).

There are two corollaries of this theorem, one of them was proved as a theorem by D. Duffus and I. Rival, the other by J. Jakubík.

Reviewer: B.Zelinka (Liberec)

### MSC:

06C05 | Modular lattices, Desarguesian lattices |

### References:

[1] | Birkhoff, G., (Lattice Theory, Vol. 25 (1948), Amer. Math. Soc. Coll. Publ: Amer. Math. Soc. Coll. Publ Providence, RI) · Zbl 0126.03801 |

[2] | Burosch, G., Hasse Graphen spezieller Ordnungen, (Wagner, K.; Bodendiek, R., Graphentheorie. Graphentheorie, Anwendungen auf Topologie, Gruppentheorie und Verbandstheorie, Band I (1989)), 157-245, BI Mannheim |

[3] | Duffus, D.; Rival, I., Path length and the covering graph of a lattice, Discrete Math., 19, 139-158 (1977) · Zbl 0372.06005 |

[4] | Faigle, U., Geometries on partially ordered sets, J. Combin. Theory, Ser. B, 28, 26-51 (1980) · Zbl 0359.05018 |

[5] | Jakubik, J., On the graph isomorphism of lattices, Czech. Math. J., 4, 131-141 (1954), (in Russian) |

[6] | Jakubik, J., On graph isomorphism of semimodular lattices, Math.- Fyz. Casopis. Sloven. Akad., 4, 162-177 (1954), (in Slovak) |

[7] | Jakubik, J., Unoriented graphs of modular lattices, Czech. Math. J., 25, 240-246 (1975) · Zbl 0314.06006 |

[8] | Pretzel, O., Orientations and reorientations of graphs, Contemporary Math., 57, 103-125 (1986) · Zbl 0595.06005 |

[9] | Reuter, K., The Kurosh-Ore exchange property, Acta math. Acad. Sci. Hung., 53, 119-127 (1989) · Zbl 0675.06003 |

[10] | Stern, M., Generalized matroid lattices, (Algebraic Methods in Graph Theory. Algebraic Methods in Graph Theory, Coll. Math. Soc. J. Bolyai, 25 (1978)), 727-748, Szeged (Hungary) · Zbl 0472.06011 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.