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
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908329743220736 |
|---|---|
| author | Blinovsky, Vladimir Sperança, Llohann D. Pchelintsev, Alexander |
| author_facet | Blinovsky, Vladimir Sperança, Llohann D. Pchelintsev, Alexander |
| contents | Assuming that Brouwers Conjecture the upper bound for the sum of t< n largest eigenvalues of Laplacian graph on n vertices true for n <n_0, we prove the Brouwers Conjecture BC for n > n_0 for some fixed n_0 |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1908_08534 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | 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 Blinovsky, Vladimir Sperança, Llohann D. Pchelintsev, Alexander Combinatorics Assuming that Brouwers Conjecture the upper bound for the sum of t< n largest eigenvalues of Laplacian graph on n vertices true for n <n_0, we prove the Brouwers Conjecture BC for n > n_0 for some fixed n_0 |
| title | 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 |
| topic | Combinatorics |
| url | https://arxiv.org/abs/1908.08534 |