References
- Chajda, I., Czédli, G. (1996). Four notes on quasiorder lattices. Math. Slovaca 46:371–378.
- Chajda, I., Czédli, G. (1996). How to generate the involution lattice of quasiorders? Studia Sci. Math. Hungar. 32:415–427.
- Czédli, G. (1996). Four-generated large equivalence lattices. Acta Sci. Math. (Szeged) 62:47–69.
- Czédli, G. (1996). Lattice generation of small equivalences of a countable set. Order 13:11–16.
- Czédli, G. (1999). (1+1+2)-generated equivalence lattices. J. Algebra 221:439–462.
- Dolgos, T. (2015). Generating equivalence and quasiorder lattices over finite sets. BSc Thesis. University of Szeged (in Hungarian).
- Kulin, J. (2016). Quasiorder lattices are five-generated. Discuss. Math. Gen. Algebra Appl. 36:59–70.
- Strietz, H. (1975). Finite partition lattices are four-generated. In: Proceedings of the Lattice Theory Conference, Held at the Universität Ulm, Ulm, August 19–22, 1975. Edited by Gudrun Kalmbach. Universität Ulm, Ulm, 1975. pp. 257–259.
- Strietz, H. (1977). Über Erzeugendenmengen endlicher Partitionverbände. Studia Sci. Math. Hungarica 12:1–17.
- Takách, G. (1996). Three-generated quasiorder lattices. Discuss. Math. Algebra Stochastic Methods 16:81–98.
- Tůma, J. (2002). On the structure of quasi-ordering lattices. Acta Univ. Carolin. Math. Phys. 43:65–74.
- Wille, R. (1973). Free modular lattices generated by finite chains. Algebra Universalis 3:131–138.
- Zádori, L. (1986). Generation of finite partition lattices. In: L. Szabó., Á. Szendrei eds., Lectures in Universal Algebra. (Proc. Colloq. Szeged, 1983). Colloq. Math. Soc. János Bolyai, Vol. 43. Amsterdam: North-Holland, pp. 573–586.