𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Counterexamples to the edge reconstruction conjecture for infinite graphs

✍ Scribed by Carsten Thomassen

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
407 KB
Volume
19
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

VWtWiCS cd ~~~tl~Jk:lJtJO?I. &JCJdty of .%iiJthYmcJtics. ~hatwrsrty of W&ur

πŸ“œ SIMILAR VOLUMES

A counterexample to a conjecture on the
A counterexample to a conjecture on the bondage number of a graph
✍ Ulrich Teschner πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 113 KB

The bondage number h(G) of a nonempty graph G was first introduced by Fink, Jacobson, Kinch and Roberts in [3]. They generalized a former approach to domination-critical graphs, In their publication they conjectured that b(G)<d(G)+ 1 for any nonempty graph G.

A Counterexample to Perret's Conjecture
A Counterexample to Perret's Conjecture on Infinite Class Field Towers for Global Function Fields
✍ Harald Niederreiter; Chaoping Xing πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 92 KB

We show by a counterexample that Perret's conjecture on in"nite class "eld towers for global function "elds is wrong, and so Perret's method of in"nite rami"ed class "eld towers in the asymptotic theory of global function "elds with many rational places breaks down.

Erratum to: β€œThe falsity of the reconstr
Erratum to: β€œThe falsity of the reconstruction conjecture for tournaments”
✍ Paul K. Stockmeyer πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 37 KB πŸ‘ 1 views

It has been brought to my attention by Ramachandran that there is an error in the proof of Theorem 1 in my paper [1]. The theorem is true-the pairs of vertex-deleted tournaments are isomorphic-but the description of the isomorphism is incorrect. The number r i should not be the remainder of i modulo

Clustering analysis for graphs with mult
Clustering analysis for graphs with multiweighted edges: A unified approach to the threshold problem
✍ Goetschel, Roy πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 494 KB πŸ‘ 2 views

Multivalent relations, inferred as relationships with an added dimension of discernment, are realized as weighted graphs with multivalued edges. A unified treatment of the threshold problem is discussed and a reliability measure is produced to judge various partitions. 'R+ represents the non-negati