✦ LIBER ✦

An Elementary Counterexample to the Finiteness Conjecture

✍ Scribed by Blondel, Vincent D.; Theys, Jacques; Vladimirov, Alexander A.

Book ID: 118216014
Publisher: Society for Industrial and Applied Mathematics
Year: 2003
Tongue: English
Weight: 128 KB
Volume: 24
Category: Article
ISSN: 0895-4798
DOI: 10.1137/s0895479801397846

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A counterexample to the finite height co

A counterexample to the finite height conjecture

✍ J. B. Nation 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 485 KB

A counterexample to Sorenson’s conjectur

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

✍ Yuji Takahashi 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 246 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 dimension conjec

A counterexample to the dimension conjecture

✍ V. K. Beloshapka 📂 Article 📅 2007 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 383 KB

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