On strong odd colorings of sparse graphs
math.CO
Submitted: 2026-10-26
Updated: 2026-10-26
License: http://creativecommons.org/licenses/by/4.0/
The gist: A strong odd coloring of a graph is a proper vertex coloring such that for every vertex v, each color appearing on the neighborhood of v appears an odd number of times.
Abstract
A strong odd coloring of a graph is a proper vertex coloring such that for every vertex v, each color appearing on the neighborhood of v appears an odd number of times. We investigate strong odd colorings of sparse graphs, where sparsity of a graph G is measured in terms of maximum average degree, denoted mad(G). We prove that the optimal threshold on the maximum average degree guaranteeing a strong odd c-coloring is 4-Θ(1 over c) as c to infinity. Moreover, for every c at least 5, this threshold is strictly smaller than the threshold for odd c-coloring. We also determine the sharp threshold on the maximum average degree guaranteeing a strong odd 5-coloring: every graph G with mad(G)< 7 over 3 has a strong odd 5-coloring, and this bound is sharp. In addition, we show that every graph G with mad(G)< 11 over 5 and no induced 5-cycle has a strong odd 4-coloring. Note that the 5-cycle has maximum average degree 2 and no strong odd 4-coloring.
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality