- R.C Brigham, R.D Dutton, “Generalized k-tuple colorings of cycles and other graphs”, Journal of Combinatorial Theory, Series B, 32, № 1, 1982, 90
- Tomohiro Koana, Vincent Froese, Rolf Niedermeier, “The complexity of binary matrix completion under diameter constraints”, Journal of Computer and System Sciences, 132, 2023, 45
- Ranjan N. Naik, S.B. Rao, S.S. Shrikhande, N.M. Singhi, “Intersection Graphs of k-uniform Linear Hypergraphs”, European Journal of Combinatorics, 3, № 2, 1982, 159
- Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge, “Exploiting hidden structure in selecting dimensions that distinguish vectors”, Journal of Computer and System Sciences, 82, № 3, 2016, 521
- Gábor Hegedűs, “Sunflowers and -intersecting families”, AKCE International Journal of Graphs and Combinatorics, 17, № 1, 2020, 402
- Danila Cherkashin, Sergei Kiselev, “Independence Numbers of Johnson-Type Graphs”, Bull Braz Math Soc, New Series, 54, № 3, 2023, 30
- André E. Kézdy, Hunter S. Snevily, Chi Wang, “Partitioning permutations into increasing and decreasing subsequences”, Journal of Combinatorial Theory, Series A, 73, № 2, 1996, 353
- H. L. Abbott, Geoffrey Exoo, “On set systems not containing delta systems”, Graphs and Combinatorics, 8, № 1, 1992, 1
- Matija Bucić, Stefan Glock, Benny Sudakov, “The intersection spectrum of 3‐chromatic intersecting hypergraphs”, Proceedings of London Math Soc, 124, № 5, 2022, 680
- Z. Füredi, I.G. Rosenberg, “Multicolored lines in a finite geometry”, Discrete Mathematics, 71, № 2, 1988, 149