Sparse Pathwidth

Home
Paper
Formalisation
Dependency graph

Release
PDF
Short version

star-bound-arb-owen

Files of ancillary/experiments/arb-certificates/star-bound-arb-owen/ (what the code computes):

I_lower_bounds-S-switched.json
I_lower_bounds.json
M.json
M5-P.json
M5-R.json
M5-S.json
S-switched.json

© 2026 Serge Gaspers. Path Decompositions of Sparse Graphs via Gaussian Sweeps and Faster Exponential Algorithms, manuscript of 2 November 2026. The paper (reading version and PDF) and all other site text: all rights reserved. Code, certificates and Lean sources: MIT.

Built with Quarto.