An elementary proof of a tight +1 bound for the additive chromatic number
math.CO
Submitted: 2026-10-19
Updated: 2026-10-19
Related papers
- Exponential random graph models with soft clique constraints
- Two Linear Programs are Better than One
- Exact Enumeration of Phylogenetic Networks: The Tree-Child, Reticulation-Visible and Orchard Hierarchy
- A complete classification of perfect state transfer in Grover walks on abelian Cayley graphs
- Arithmetic Circuits and Neural Networks for Regular Matroids
- On composition and decomposition operations for vector spaces, graphs and matroids