The rank and size of graphs
From MaRDI portal
Publication:4894621
DOI<185::AID-JGT9>3.0.CO;2-P 10.1002/(SICI)1097-0118(199610)23:2<185::AID-JGT9>3.0.CO;2-PzbMath0858.05060MaRDI QIDQ4894621
László Lovász, Andreĭ V. Kotlov
Publication date: 7 October 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199610)23:2<185::aid-jgt9>3.0.co;2-p
05C35: Extremal problems in graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Unnamed Item, Maximum Order of Triangle‐Free Graphs with a Given Rank, Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings, Around the log-rank conjecture, On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph, Automorphisms of the double cover of a circulant graph of valency at most 7, A discrete variation of the Littlewood-Offord problem, Reducing rank of the adjacency matrix by graph modification, Maximal and extremal singular graphs, The maximum order of adjacency matrices of graphs with a given rank, Rank reduction of oriented graphs by vertex and edge deletions, Some relations among term rank, clique number and list chromatic number of a graph, Constructing and classifying neighborhood anti-Sperner graphs, On the rank of a matrix associated with a graph., On order and rank of graphs, Maximum order of trees and bipartite graphs with a given rank, Distance-hereditary comparability graphs, Rank, term rank and chromatic number of a graph, Chromatic number and the 2-rank of a graph, Matrix rank and communication complexity, Some structural properties of low-rank matrices related to computational complexity, On automorphisms of direct products of Cayley graphs on abelian groups, Univariate ideal membership parameterized by rank, degree, and number of generators, Maximum order of graphs with a given corank, Maximal graphs with respect to rank, Conformally covariant operators and conformal invariants on weighted graphs, Edge-transitive graphs of small order and the answer to a 1967 question by Folkman, A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree, Real symmetric matrices and their negative eigenvalues, Reducing Rank of the Adjacency Matrix by Graph Modification
