@techreport{cd086add9be744aea1cd7df4db73aab5,
title = "The Maximum Order of Reduced Square(0, 1)-Matrices with a Given Rank",
abstract = "We look for the maximum order of a square (0, 1)-matrix A with a fixed rank r, provided A has no repeated rows or columns. If A is the adjacency matrix of a graph, Kotlov and Lov{\'a}sz [J. Graph Theory 23, 1996] proved that the maximum order equals Θ(2r/2). In this note we show that this result remains correct if A is symmetric, but becomes false if symmetry is not required.",
keywords = "(0, 1)-matrix, rank, graph",
author = "W.H. Haemers and M.J.P. Peeters",
note = "Subsequently published in the Electronic Journal of Linear Algebra (2012)",
year = "2011",
language = "English",
volume = "2011-113",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",
}