A counterexample to the rank-coloring conjecture
From MaRDI portal
Publication:3828021
DOI10.1002/jgt.3190130413zbMath0674.05029WikidataQ123346984 ScholiaQ123346984MaRDI QIDQ3828021
Publication date: 1989
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190130413
hypergraph; Cayley graph; eigenvalues; adjacency matrix; chromatic number; communication complexity; rank-coloring conjecture
05C65: Hypergraphs
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C15: Coloring of graphs and hypergraphs
Related Items
The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear, Communication complexity and combinatorial lattice theory, Some combinatorial-algebraic problems from complexity theory, On rank vs. communication complexity, On the ``log rank-conjecture in communication complexity, Matrix rank and communication complexity