References
- Albano, Alexandre. 2014. “Upper Bound for the Number of Concepts of Contranominal-scale Free Contexts.” Formal Concept Analysis -- 12th International Conference, ICFCA 2014, Proceedings, Cluj-Napoca, Romania, June 10--13, 2014, 44–53.
- Albano, Alexandre. 2017. “The Implication Logic of (n, k)-Extremal Lattices.” In Formal Concept Analysis: 14th International Conference, ICFCA 2017, Rennes, France, June 13--16, 2017, Proceedings, edited by K. Bertet, D. Borchmann, P. Cellier, and S. Ferr{\’e}, 39–55. Cham: Springer International Publishing. doi:10.1007/978-3-319-59271-8\_3.
- Albano, Alexandre, and Alair Pereira do Lago. 2014. “A Convexity Upper Bound for the Number of Maximal Bicliques of a Bipartite Graph.” Discrete Applied Mathematics165 :12–24. 10th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2011).
- Blumer, Anselm, A. Ehrenfeucht, David Haussler, Manfred K. Warmuth. 1989. “Learnability and the Vapnik-Chervonenkis Dimension.” J. ACM 36 (4): 929–965.
- Edelman, Paul H. 1980. “Meet-distributive Lattices and the Anti-exchange Closure.” Algebra Universalis 10 (1): 290–299.
- Eppstein, David. 1994. “Arboricity and Bipartite Subgraph Listing Algorithms.” Information Processing Letters 51 (4): 207–211.
- Frankl, Peter. 1983. “On the Trace of Finite Sets.” Journal of Combinatorial Theory, Series A 34 (1): 41–45.
- Ganter, Bernhard, and Rudolf Wille. 1999. Formal Concept Analysis: Mathematical Foundations. Berlin-Heidelberg: Springer.
- Haussler, David, and M. Long Philip. 1995. “A Generalization of Sauer’s Lemma.” Journal of Combinatorial Theory, Series A 71 (2): 219–240.
- Jukna, Stasys. 2010. Extremal Combinatorics: With Applications in Computer Science. 1st ed. Springer Publishing Company, Incorporated.
- Kuznetsov, Sergei O. 2001. “On Computing the Size of a Lattice and Related Decision Problems.” Order 18 (4): 313–321.
- Michael, J. 1978. “Steele. Existence of Submatrices with all Possible Columns.” Journal of Combinatorial Theory, Series A 24 (1): 84–88.
- Prisner, Erich. 2000. “Bicliques in Graphs I: Bounds on Their Number.” Combinatorica 20 (1): 109–117.
- Sauer, N. 1972. “On the Density of Families of Sets.” Journal of Combinatorial Theory, Series A 13 (1): 145–147.
- Schütt, Dieter. 1987. “Abschätzungen für die Anzahl der Begriffe von Kontexten.” Master’s thesis, TH Darmstadt.
- Worsch, Thomas. 1994. “Lower and upper bounds for (sums of) binomial coefficients.” http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.9677.