PreprintCC BY 4.0Zenodo
Programs over Finite Groups and the Degree of Non-3-Colourability
Abstract
Official Github repository: https://github.com/achemperety/group-programs
Related
- Minimum-degree thresholds beyond bounded colourability
- Vanishing of degree $3$ unramified cohomology over finite fields
- On the sample complexity of the generalized hidden shift problem over arbitrary finite groups
- On covering systems over finite nilpotent groups and lattices
- The finite-degree profile of essential dimension II: cyclic p-groups in characteristic p
BibTeX
@misc{baiandin2026programs,
title = {{Programs over Finite Groups and the Degree of Non-3-Colourability}},
author = {Ruslan Baiandin},
howpublished = {Zenodo},
year = {2026},
month = oct,
doi = {10.5281/zenodo.23448335},
url = {https://zenodo.org/records/23448335},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Programs over Finite Groups and the Degree of Non-3-Colourability
AU - Ruslan Baiandin
PY - 2026
DA - 2026/10/18
PB - Zenodo
DO - 10.5281/zenodo.23448335
UR - https://zenodo.org/records/23448335
AB - Official Github repository: https://github.com/achemperety/group-programs
ER -