References
- Cheung, K. K. H., Gleixner, A., Steffy, D. E . (2017). Verifying integer programming results. In Friedrich Eisenbrand and Jochen Koenemann (Editors), International Conference on Integer Programming and Combinatorial Optimization. Springer, pp. 148–160. Cham.
- Cook, W., Koch, T., Steffy, D. E., Wolter, K. (2013). A hybrid branch-and-bound approach for exact rational mixed-integer programming. Math. Program. Comput. 5(3): 305–344.
- Csardi, G., Nepusz, T. (2006). The igraph software package for complex network research. InterJ. Complex Syst. 1695(5): 1–9.
- Gao, W., Yu, H. (1998). Note on the union-closed sets conjecture. Ars Comb. 49. arXiv:1704.07022.
- Gowers, T.. (2016) Polymath11–func4. Available at: https://gowers.wordpress.com.
- Johnson, R. T., Vaughan, T. P. (1998). On union-closed families, I. J. Combin. Theory, Ser. A. 84(2): 242–249.
- Marić, F., Vučković, B., Živković, M. (2019). Fully automatic, verified classification of all frankl-complete (fc(6)) set families. arXiv:1902.08765
- Filip Marić, Miodrag Živković, and Bojan Vučković. (2012). Formalizing Frankl’s conjecture: FC-families. In Johan Jeuring, John A. Campbell, Jacques Carette, Gabriel Dos Reis, Petr Sojka, Makarius Wenzel, Volker Sorge (Editors), International Conference on Intelligent Computer Mathematics. Springer, pp. 248–263. Berlin, Heidelberg.
- Morris, R. (2006). FC-families and improved bounds for Frankl’s conjecture. Eur. J. Combin. 27(2): 269–282. doi:10.1016/j.ejc.2004.07.012
- Poonen, B. (1992). Union-closed families. J. Combin. Theory, Ser. A. 59(2): 253–268.
- Pulaj, J. (2017). Cutting planes for union-closed families. Dissertation. Technische Universität Berlin.
- Pulaj, J. (2020). Cutting planes for families implying Frankl’s conjecture. Math. Comput. 89(322): 829–857.
- Pulaj, J., Raymond, A., Theis, D. (2016). New conjectures for union-closed families. Electron. J. Comb. 23(3).
- Sarvate, D. G., Renaud, J. C. (1989). On the union-closed sets conjecture. Ars Comb. 27: 149–154.
- Sarvate, D. G., Renaud, J. C. (1990). Improved bounds for the union-closed sets conjecture. Ars Comb. 29: 181–185.
- The Sage Developers, William S., David J., David K., John C., Ercal, B. (2020). Sage Mathematics Software, Version 9.1.0. The Sage Development Team. Available at: http://www.sagemath.org.
- Vaughan, T. (2005). More on 3-sets in union-closed families: The end is in sight. In South East Regional Meeting On Numbers 2005,
- Vaughan, T. P. (2002). Families implying the Frankl conjecture. Eur. J. Combin. 23(7): 851–860. doi:10.1006/eujc.2002.0586
- Vaughan, T. P. (2003). A note on the union-closed sets conjecture. J. Combin. Math. Combin. Comput. 45: 97–110.
- Vaughan, T. P. (2004). Three-sets in a union-closed family. J. Combin. Math. Combin. Comput. 49: 73–84.