✦ LIBER ✦

A counterexample to the triangle conjecture

✍ Scribed by P.W Shor

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 107 KB
Volume: 38
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(85)90032-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

The depth conjecture: A counterexample

✍ Ada Maria de Souza Doering 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Counterexamples to a conjecture of Tamas

Counterexamples to a conjecture of Tamaschke

✍ E.C Dade 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 247 KB

A counterexample to a conjecture of gran

A counterexample to a conjecture of grant

✍ Mao-cheng Cai 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 74 KB

We give a counterexample to the following conjecture of Douglas D. Grant Cl]: If a positive integer t 3 2 and D is a strict digraph of order 2t such that S+(D) 3 t and S'(D)2 t, then D has an anti-directed hamiltonian cycle. Where S+(D) and 6-(D) denote the minimum indegree and outdegree, respective

A counterexample to a conjecture of Hass

A counterexample to a conjecture of Hasson

✍ Chengmin Yang 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 127 KB