𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A counterexample to Sorenson’s conjecture: The finitely generated case

✍ Scribed by Yuji Takahashi

Publisher
Springer
Year
2002
Tongue
English
Weight
246 KB
Volume
67
Category
Article
ISSN
0037-1912

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A counterexample to the bold conjecture
A counterexample to the bold conjecture
✍ Sakuma, Tadashi 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 1 views

A pair of vertices (x, y) of a graph G is an ω-critical pair if ω(G + xy) > ω(G), where G + xy denotes the graph obtained by adding the edge xy to G and ω(H) is the clique number of H. The ω-critical pairs are never edges in G. A maximal stable set S of G is called a forced color class of G if S mee

A counterexample to the rank-coloring co
A counterexample to the rank-coloring conjecture
✍ N. Alon; P. D. Seymour 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

It has been conjectured by C. van Nuffelen that the chromatic number of any graph with at least one edge does not exceed the rank of its adjacency matrix. We give a counterexample, with chromatic number 32 and with an adjacency matrix of rank 29.