Sebastian M. Cioabă, Michael Tait, “Variations on a theme of Graham and Pollak”, Discrete Mathematics, 313, № 5, 2013, 665
Aidan Roy, Gordon F. Royle, “The chromatic number and rank of the complements of the Kasami graphs”, Discrete Mathematics, 307, № 1, 2007, 132
Stasys Jukna, “On set intersection representations of graphs”, Journal of Graph Theory, 61, № 1, 2009, 55
Noam Nisan, Avi Wigderson, “On rank vs. communication complexity”, Combinatorica, 15, № 4, 1995, 557
Long Wang, Dein Wong, “Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank”, Discrete Applied Mathematics, 166, 2014, 276
Adi Shraibman, “The corruption bound, log-rank, and communication complexity”, Information Processing Letters, 141, 2019, 16
Bruno Codenotti, Gianna Del Corso, Giovanni Manzini, “Matrix rank and communication complexity”, Linear Algebra and its Applications, 304, № 1-3, 2000, 193
Alexander A. Razborov, An Invitation to Mathematics, 2011, 97
Paul Valiant, “The Log-Rank Conjecture and low degree polynomials”, Information Processing Letters, 89, № 2, 2004, 99
M. Karchmer, M. Saks, I. Newman, A. Wigderson, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992, 275