Published August 24, 2026
| Version 0.1.0-candidate
Preprint
Open
A 48-vertex cubic counterexample to independent domination versus minimum maximal matching
Authors/Creators
Description
Anonymous, unrefereed, certificate-backed candidate presenting one explicit connected cubic graph on 48 vertices with minimum maximal matching number 15 and independent domination number 16. This lowers the known candidate-order upper bound to 48; it does not establish global minimality, uniqueness, priority, independent reproduction, formal verification, specialist review, peer review, or impact.
Files
SHA256SUMS.txt
Files
(1.6 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:d8f01e1e30d4aab1f6f6366df57fcdaf
|
499 Bytes | Preview Download |
|
md5:308c2a1781ff416be0ff7b662622d8f5
|
568.6 kB | Preview Download |
|
md5:82a03a08d0491e63f84d1612e8026373
|
172.4 kB | Preview Download |
|
md5:c840aaa2fc3464f9d8bbef05a369847a
|
279.9 kB | Preview Download |
|
md5:a52e06cfbb0d7fc27507c92fc78c90fb
|
559.5 kB | Preview Download |
Additional details
Related works
- Cites
- 10.7151/dmgt.2317 (DOI)
- 10.5281/zenodo.21852504 (DOI)
- Is derived from
- Preprint: 10.5281/zenodo.21852504 (DOI)
- Is supplemented by
- Software: https://github.com/ipitchford/txgraffiti-order48-successor (URL)
References
- Caro, Y., Davila, R., & Pepper, R. (2021). New results relating independence and matchings. Discussiones Mathematicae Graph Theory, 41, 921-935. https://doi.org/10.7151/dmgt.2317
- Release contributors. (2026). TxGraffiti Conjecture 15/3 resolution: a certificate-backed candidate counterexample (Version 4.0.0-rc1). https://doi.org/10.5281/zenodo.21852504
- TxGraffiti Conjecture 3 counterexample repository and public predecessor objects. https://github.com/djma/TxGraffiti-conjecture3-counterexample