txh2120/bhs-counterexamples: v1.2.0 — Major Revision
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
v1.2.0 — Major Revision Theorem Statement Corrections Theorems 1(a)(b) and 4.2: restated violation condition as "at t = 2m-1" (previously claimed "for all t >= 2m-1", which is incorrect — violation window is finite for each m) Theorem 4.3: fixed exponent error, aligned example to SoC(K_9,17) Attribution Correction AutoGraphiX attribution corrected per Dragan Stevanovic feedback: bounds generated by backward-reconstruction algorithm, not AutoGraphiX Removed incorrect Roucairol-Cazenave citation (addresses Graffiti conjectures, not BHS bounds) Updated Ghebleh et al. to DAM publication (2026, Vol. 380, pp. 468-479) Sections 5-6 Rewrite Section 5: hub-invisible/visible classification for all 24 vertex-type bounds, formalized Bound 40 transient window and Bound 45 antisymmetric mechanism Section 6: formal classification criteria (Definition), 33-bound status table, Ghebleh comparison, exhaustive verification of 3 tight bounds Other Fixes SoS(49,9) verification added to Theorem 4.7 Bound 48 P3 degree correction Section 5 connector formula and mu asymptotic corrected Table overflow resolved, overfull hbox warnings fixed Unused bibliography entries removed Paper: 20 pages, 0 errors, 0 undefined references.
Fields of Study & Subjects
Graph theory and applications
Advanced Graph Theory Research
Limits and Structures in Graph Theory
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 31 March 2026
- Language
- EN