The Rank and Size of Graphs

Andrew Kotlov, László Lovász

Research output: Contribution to journalArticle

34 Citations (Scopus)


We show that the number of points with pairwise different sets of neighbors in a graph is O(2r/2), where r is the rank of the adjacency matrix. We also give an example that achieves this bound.

Original languageEnglish
Pages (from-to)185-189
Number of pages5
JournalJournal of Graph Theory
Issue number2
Publication statusPublished - Oct 1996


ASJC Scopus subject areas

  • Geometry and Topology

Cite this