๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The depth conjecture: A counterexample

โœ Scribed by Ada Maria de Souza Doering

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
299 KB
Volume
77
Category
Article
ISSN
0021-8693

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.

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