Published March 31, 2026
| Version v1.1.0
Software
Open
txh2120/bhs-counterexamples: v1.1.0 — Exhaustive verification + weighted Laplacian lemma
Authors/Creators
Description
What's new
- Exhaustive verification (Section 6.1): Bounds 33, 42, 47 verified on all connected graphs with n ≤ 10 (11,988,768 graphs, zero violations)
- Weighted Laplacian lemma (Proposition 5.5): Proved μ(G)² ≤ λ_max(M) where M has edge weights d_i + d_j
- Proof discussion (Section 7): 16+ techniques attempted, fundamental obstacle identified
- Reference [4] fix: Ghebleh et al. citation updated with volume 380 and DOI
Paper: 14 pages (was 12 in v1.0.0).
Files
txh2120/bhs-counterexamples-v1.1.0.zip
Files
(5.1 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:48b7564788b966626c567faba9511703
|
5.1 MB | Preview Download |
Additional details
Related works
- Is supplement to
- Software: https://github.com/txh2120/bhs-counterexamples/tree/v1.1.0 (URL)
Software
- Repository URL
- https://github.com/txh2120/bhs-counterexamples