The paper conjectures that the Lovász theta function of G(n,1/2) is below 1.55√n, via new graph parameters built from the eigen-decomposition of the adjacency matrix, but leaves the bound as an unproven conjecture.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Upper bounds on the theta function of random graphs
The paper conjectures that the Lovász theta function of G(n,1/2) is below 1.55√n, via new graph parameters built from the eigen-decomposition of the adjacency matrix, but leaves the bound as an unproven conjecture.