Summary: This paper is an erratum of H. Mühle: Distributive lattices have the intersection property, Math. Bohem. (2021). Meet-distributive lattices form an intriguing class of lattices, because they are precisely the lattices obtainable from a closure operator with the so-called anti-exchange property. Moreover, meet-distributive lattices are join semidistributive. Therefore, they admit two natural secondary structures: the core label order is an alternative order on the lattice elements and the canonical join complex is the flag simplicial complex on the canonical join representations. In this article we present a characterization of finite meet-distributive lattices in terms of the core label order and the canonical join complex, and we show that the core label order of a finite meet-distributive lattice is always a meet-semilattice.
[8] Freese, R., Ježek, J., Nation, J. B.: Free Lattices. Mathematical Surveys and Monographs 42. American Mathematical Society, Providence (1995). DOI 10.1090/surv/042 | MR 1319815 | Zbl 0839.06005
[9] Garver, A., McConville, T.: Oriented flip graphs of polygonal subdivisions and noncrossing tree partitions. J. Comb. Theory, Ser. A 158 (2018), 126-175. DOI 10.1016/j.jcta.2018.03.014 | MR 3800125 | Zbl 1427.05235