✦ LIBER ✦

Counterexamples to the Strongd-Step Conjecture ford≥5

✍ Scribed by F. Holt; V. Klee

Publisher: Springer
Year: 1998
Tongue: English
Weight: 148 KB
Volume: 19
Category: Article
ISSN: 0179-5376
DOI: 10.1007/pl00009334

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Restrictions On Smallest Counterexamples

Restrictions On Smallest Counterexamples To The 5-Flow Conjecture

✍ Martin Kochol* 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 154 KB

Counterexamples to the Baum—Connes conje

Counterexamples to the Baum—Connes conjecture

✍ N. Higson; V. Lafforgue; G. Skandalis 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 273 KB

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 paramagnetic con

A counterexample to the paramagnetic conjecture

✍ J. Avron; B. Simon 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 174 KB

A counterexample to the triangle conject

A counterexample to the triangle conjecture

✍ P.W Shor 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 107 KB

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.