Abstract
We investigate properties which hold for both the lattice of a binary relation and for its ’mirror lattice’, which is the lattice of the complement relation.
We first prove that the relations whose lattice is dismantlable corres-pond to the class of chordal bipartite graphs; we provide algorithmic tools to find a doubly irreducible element in such a lattice.
We go on to show that a lattice is dismantlable and its mirror lattice is also dismantlable if and only if both these lattices are planar.
Research partially supported by the French Agency for Research under the DEFIS program TODO, ANR-09-EMER-010.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
http://conexp.sourceforge.net/download.html , release 1.3 © Yevtushenko, S.A., et al. (2000-2006); Yevtushenko, S.A.: System of data analysis “Concept Explorer”. In: Proc. 7th Nat. Conf. on Artif. Intell., KII 2000 (Ru.), pp. 127–134 (2000) (in Russian)
Abueida, A.A., Busch, A.H., Sritharan, R.: A Min-Max Property of Chordal Bipartite Graphs with Applications. Graphs and Combinatorics 26(3), 301–313 (2010)
Baker, K.A., Fishburn, P.C., Roberts, F.S.: Partial orders of dimension 2, Interval Orders, and Interval Graphs. Networks 2(1), 11–28 (1972)
Berry, A., Sigayret, A.: Representing a concept lattice by a graph. Discrete Applied Mathematics 144(1-2), 27–42 (2004)
Berry, A., Sigayret, A.: A peep through the looking glass: Articulation points in lattices. In: Domenach, F., Ignatov, D.I., Poelmans, J. (eds.) ICFCA 2012. LNCS (LNAI), vol. 7278, pp. 45–60. Springer, Heidelberg (2012)
Birkhoff, G.: Lattice Theory, 3rd edn. American Mathematical Society (1967)
Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Math. Appl. 3 (1999)
Brucker, F., Gély, A.: Crown-free Lattices and Their Related Graphs. Order 28(3), 443–454 (2011)
Caspard, N., Leclerc, B., Monjardet, B.: Ensembles ordonnés finis: Concepts, résultats et usages. Mathémathiques et Applications, vol. 60. Springer (2007)
Deiters, K., Erné, M.: Negations and contrapositions of complete lattices. Discrete Mathematics, 181(1-3), 91–111 (1998)
Dushnik, B., Miller, E.W.: Partially ordered sets. Amer. J. Mathematics 63, 600–610 (1941)
Eschen, E.M., Pinet, N., Sigayret, A.: Consecutive-ones: Handling lattice planarity efficiently. In: Proc. CLA 2007 (2007)
Ganter, B., Wille, R.: Formal Concept Analysis. Springer (1999)
Golumbic, M.M., Goss, M.C.: Perfect Elimination and Chordal Bipartite Graphs. Journal of Graph Theory 2(2), 155–163 (1978)
Hammer, P.L., Maffray, F., Preissmann, M.: A characterization of chordal bipartite graphs. RUTCOR Research Report, Rutgers University (New Brunswick, NJ), pp. 16–89 (1989)
Kloks, T., Kratsch, D.: Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph. Information Processing Letters 55(1), 11–16 (1995)
Li, L.: Private communication
Lubiw, A.: Doubly lexical orderings of matrices. SIAM J. Comput. 16(5), 854–879 (1987)
Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973–989 (1987)
Rival, I.: Lattices with doubly irreducible elements. Canadian Mathematical Bulletin 17(1), 91–95 (1974)
Kelly, D., Rival, I.: Crowns, fences, and dismantlable lattices. Canadian J. Mathematics 26, 1257–1271 (1974)
Spinrad, J.P.: Efficient Graph Representations. Fields Institute Monographs, vol. 19. AMS (2003)
Spinrad, J.P.: Doubly lexical ordering of dense 0-1 matrices. Information Processing Letters 45(5), 229–235 (1993)
Spinrad, J.P., Sritharan, R.: Algorithms for weakly triangulated graphs. Discrete Applied Mathematics 19, 181–191 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berry, A., Sigayret, A. (2013). Dismantlable Lattices in the Mirror. In: Cellier, P., Distel, F., Ganter, B. (eds) Formal Concept Analysis. ICFCA 2013. Lecture Notes in Computer Science(), vol 7880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38317-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-38317-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38316-8
Online ISBN: 978-3-642-38317-5
eBook Packages: Computer ScienceComputer Science (R0)