✦ LIBER ✦

A counterexample to the dimension conjecture

✍ Scribed by V. K. Beloshapka

Book ID: 110149009
Publisher: SP MAIK Nauka/Interperiodica
Year: 2007
Tongue: English
Weight: 383 KB
Volume: 81
Category: Article
ISSN: 0001-4346
DOI: 10.1134/s0001434607010117

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counterexamples to the Kneser conjecture

Counterexamples to the Kneser conjecture in dimension four

✍ Matthias Kreck; Wolfgang Lück; Peter Teichner 📂 Article 📅 1995 🏛 European Mathematical Society 🌐 English ⚖ 511 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.

A weak counterexample to the Carathéodor

A weak counterexample to the Carathéodory conjecture

✍ Larry Bates 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 14 KB

We construct a closed surface with a single topological umbilic point of index two.