More counterexamples to the Alon-Saks-Seymour and rank-coloring conjectures

From MaRDI portal
Publication:625392





The Rank-Coloring Conjecture states that the chromatic number \(\chi(G) \leq rank(A(G))\), the rank of the adjacency matrix of the graph \(G\). The Alon, Saks, and Seymour Conjecture states that \(\chi(G) \leq bp(G) + 1\), where \(bp(G)\) is the complete bipartite partition number for the graph \(G\). Using a family of graphs \(G(n, k, r)\), which are patterned after \(n\)-dimensional cube \(Q_n\), they give counterexamples to each of the previously mentioned Conjectures.











This page was built for publication: More counterexamples to the Alon-Saks-Seymour and rank-coloring conjectures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625392)