## Abstract The conjecture that for all sufficiently large __p__ any tournament of order __p__ is uniquely reconstructable from its pointβdeleted subtournaments is shown to be false. Counterexamples are presented for all orders of the form 2^n^ + 1 and 2^n^ + 2. The largest previously known counter
Falsity of Wang's conjecture on stars
β Scribed by C.S.Karuppan Chetty; S.Maria Arulraj
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 276 KB
- Volume
- 277
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
Let Q,, denote the set of all n x n doubly stochastic matrices. E.T.H. Wang called a matrix B C Q,, a star if per(:cB + ( 1 -:Β’)A) ~< cΒ’ per(B) + (1 ~) per(A) for all A C f~. and for all :~ E [0, 1] and conjectured in 1979 that for n/> 3, permutation matrices are the only stars. In this paper we disprove Wang's conjecture for n = 3, by showing that PBQ is a star where E X ';1 ~1, 0~<x~<l B= 1-x and P and Q are permutation matrices. We also establish that the only stars in Q3 are PBQ as defined above.
π SIMILAR VOLUMES
## Abstract Wang and Williams defined a __threshold assignment__ for a graph __G__ as an assignment of a nonβnegative weight to each vertex and edge of __G__, and a threshold __t__, such that a set __S__ of vertices is stable if and only if the total weight of the subgraph induced by __S__ does not
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