Brouwer's conjecture holds asymptotically almost surely

From MaRDI portal
Publication:2174101

DOI10.1016/J.LAA.2020.03.019zbMATH Open1437.05217arXiv1906.05368OpenAlexW3013995970WikidataQ122999436 ScholiaQ122999436MaRDI QIDQ2174101FDOQ2174101


Authors: Israel Rocha Edit this on Wikidata


Publication date: 17 April 2020

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: We show that for a sequence of random graphs Brouwer's conjecture holds true with probability tending to one as the number of vertices tends to infinity. Surprisingly, it was found that a similar statement holds true for weighted graphs with possible negative weights as well. For graphs with a fixed number of vertices, the result implies that there are constants C>0 and n0 such that if ngeqn0 then among all 2nchoose2 graphs with n vertices, at least left(1expleft(Cnight)ight)2nchoose2 graphs satisfy Brouwer's conjecture.


Full work available at URL: https://arxiv.org/abs/1906.05368




Recommendations




Cites Work


Cited In (3)





This page was built for publication: Brouwer's conjecture holds asymptotically almost surely

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174101)