✦ LIBER ✦

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

✍ Scribed by A.A. Razborov

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 199 KB
Volume: 108
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90691-8

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

Chromatic Number and the 2-Rank of a Gra

Chromatic Number and the 2-Rank of a Graph

✍ C.D. Godsil; Gordon F. Royle 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 98 KB

We show that if the adjacency matrix of a graph X has 2-rank 2r, then the chromatic number of X is at most 2 r +1, and that this bound is tight. 2001

Inequalities between the domination numb

Inequalities between the domination number and the chromatic number of a graph

✍ Dieter Gernert 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Upper bounds for u + x and ax are proved, where u is the domination number and x the chromatic number of a graph.

The star chromatic number of a graph

✍ H. L. Abbott; B. Zhou 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 469 KB 👁 2 views

## Abstract We study a generalization of the notion of the chromatic number of a graph in which the colors assigned to adjacent vertices are required to be, in a certain sense, far apart. © 1993 John Wiley & Sons, Inc.

The chromatic covering number of a graph

✍ Reza Naserasr; Claude Tardif 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

Following [1] , we investigate the problem of covering a graph G with induced subgraphs G 1 ; . . . ; G k of possibly smaller chromatic number, but such that for every vertex u of G, the sum of reciprocals of the chromatic numbers of the G i 's containing u is at least 1. The existence of such ''ch

A note on the line-distinguishing chroma

A note on the line-distinguishing chromatic number and the chromatic index of a graph

✍ N. Zagaglia Salvi 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract Let λ(__G__) be the line‐distinguishing chromatic number and __x__′(__G__) the chromatic index of a graph __G__. We prove the relation λ(__G__) ≥ __x__′(__G__), conjectured by Harary and Plantholt. © 1993 John Wiley & Sons, Inc.

A gap between the appearances of a k-cor

A gap between the appearances of a k-core and a (k + 1)-chromatic graph

✍ Michael Molloy 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB 👁 1 views

We observe that the values of p for which with high probability Gm,p is k-colorable and for which with high probability G,,p has no k-core are not equal for k 2 4.