Abstract
We give a complete list of lattices associated to closure systems generated by four maximal cliques and generalize a known characterization to uniform hypergraphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
See also Järvinen and Radeleczki [4] for other aspects.
References
Brucker, F., Gély, A.: Crown-free lattices and their related graphs. Order 28, 443–454 (2011)
Ganter, B., Obiedkov, S.: Conceptual Exploration, Springer, Berlin (2016). https://doi.org/10.1007/978-3-662-49291-8
Gilmore, P.C.: Families of sets with faithful graph representation. J. Watson Research Center, Yorktown Heights, Technical report (1962)
Järvinen, J., Radeleczki, S.: Tolerances induced by irredundant coverings. Fund. Inform. 137(3), 341–353 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Dahlhaus, E., Ganter, B. (2023). Examples of Clique Closure Systems. In: Dürrschnabel, D., López Rodríguez, D. (eds) Formal Concept Analysis. ICFCA 2023. Lecture Notes in Computer Science(), vol 13934. Springer, Cham. https://doi.org/10.1007/978-3-031-35949-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-031-35949-1_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-35948-4
Online ISBN: 978-3-031-35949-1
eBook Packages: Computer ScienceComputer Science (R0)