Twin-width can be exponential in treewidth
No public endorsements yet.
Loading review…
Sign in with ORCIDAbstract
For every natural number , there is a finite simple graph whose treewidth and twin-width satisfy
11 pages · 7 marked passages
Concepts
Concept map
Proofs
Proof networkview on GitHub
Proof list
Lean sources for these proofs: proofs/ on GitHub
Proof code is not displayed; the archive records each proof's checked relationship between claims.
Related submissions
Submission map
Cite this
This is only the formalizers. The authors of the formalized results may be different (see References).
@misc{lax-228581,
author = {Édouard Bonnet and Jan Dreier and Claude Fable 5 (Anthropic) and Codex (OpenAI)},
title = {Twin-width can be exponential in treewidth},
year = {2026},
howpublished = {Lax Archive, lax-228581},
url = {https://laxarchive.org/lax-228581/},
}
References
- Édouard Bonnet and Hugues Déprés. Twin-width can be exponential in treewidth. Journal of Combinatorial Theory, Series B 161:1–14, 2023. doi:10.1016/j.jctb.2023.01.003
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments