χ-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs
No public endorsements yet.
Loading review…
Sign in with ORCIDAbstract
This submission formalizes two results of Marthe Bonamy and Colin Geniet: every graph class of bounded merge-width is χ-bounded, and every such class has linear neighbourhood complexity, Theorems 1.2 and 1.5 of χ-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs (https://arxiv.org/abs/2504.08266). In particular, merge sequences, radius- merge-width, χ-boundedness, and neighbourhood complexity are defined in Lean.
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
No other submission in the archive builds on this one, and this one builds on none.
Cite this
This is only the formalizers. The authors of the formalized results may be different (see References).
@misc{lax-9,
author = {Édouard Bonnet},
title = {χ-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs},
year = {2026},
howpublished = {Lax Archive, lax-9},
url = {https://laxarchive.org/lax-9/},
}
References
- Marthe Bonamy and Colin Geniet. χ-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs. 2025. doi:10.48550/arXiv.2504.08266 · arXiv:2504.08266
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments