A purported proof of Brouwer's conjecture fails at equation (2), where a false vertex-deletion interlacing chain invalidates the recursive argument.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Proof of Brouwers Conjecture (BC) for all graphs with number of vertices n > n_0 assuming that BC holds for n< n_0 for some n_0
A purported proof of Brouwer's conjecture fails at equation (2), where a false vertex-deletion interlacing chain invalidates the recursive argument.