1. Aharoni, R., Haxell, P.: Hall’s theorem for hypergraphs. J. Graph Theory 35(2), 83–88 (2000)
2. Anastos, M., Frieze, A.: Finding perfect matchings in random cubic graphs in linear time. arXiv preprint arXiv:1808.00825 (2018)
3. Berman, P., Karpinski, M.: Improved approximation lower bounds on small occurence optimization. ECCC Report (2003)
4. Birkhoff, G.: Tres observaciones sobre el algebra lineal. Univ. Nac. Tucuman, Ser. A 5, 147–154 (1946)
5. Carlson, A., Betteridge, J., Kisiel, B., Settles, B., Hruschka Jr., E.R., Mitchell, T.M.: Toward an architecture for never-ending language learning. In: AAAI, vol. 5, p. 3 (2010)