The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear

Authors:
A. A. Razborov
Affiliations:
-
Venue:
Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
Year:
1992

Citing 0
Cited 4

Improving the discrepancy bound for sparse matrices: better approximations for sparse lattice approximation problems

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Rank, term rank, and chromatic number

Discrete Mathematics
The Log-Rank conjecture and low degree polynomials

Information Processing Letters
Note: Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract