Proof of Brouwer's conjecture (BC) for all graphs with number of vertices \(n>n_0\) assuming that (BC) holds for \(n\leq n_0\) for some \(n_0 \leq 10^{24}\) (Q6943189)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8079801
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proof of Brouwer's conjecture (BC) for all graphs with number of vertices \(n>n_0\) assuming that (BC) holds for \(n\leq n_0\) for some \(n_0 \leq 10^{24}\) |
scientific article; zbMATH DE number 8079801 |
Statements
Proof of Brouwer's conjecture (BC) for all graphs with number of vertices \(n>n_0\) assuming that (BC) holds for \(n\leq n_0\) for some \(n_0 \leq 10^{24}\) (English)
0 references
14 August 2025
0 references
Laplacian of graph
0 references
eigenvalues
0 references
