Single Conflict Coloring in Graphs & Hypergraphs

• Single Conflict Coloring is a graph and hypergraph paradigm that defines colorings by avoiding locally assigned forbidden color pairs.
• It employs probabilistic techniques, degeneracy-based orientations, and the Lovász Local Lemma to establish bounds like O(√d log n) for d-degenerate graphs.
• The concept generalizes separation and adaptable choosability, linking structural combinatorics with conflict-free and distributed coloring strategies.

Single conflict coloring is a contemporary graph and hypergraph coloring paradigm synthesizing local orientation, list coloring, and forbidden pair frameworks. The core objective is to determine the chromatic threshold under which, for any local assignment of forbidden color pairs (or tuples in hypergraphs), there exists a feasible vertex coloring that avoids all induced edge conflicts. This concept interfaces with separation choosability, adapted choosability, and several conflict-free coloring models, providing a unifying lens for both structural combinatorics and algorithmic graph theory.

1. Fundamental Definitions and Notions

Let $G = (V, E)$ be a (multi)graph, potentially with parallel edges (no loops). A local $k$-partition assigns to each vertex $v$ a labeling function on incident edges: $c_v \colon E(v) \to \{1, 2, \dots, k\}$ where $E(v)$ is the set of edges incident with $v$. Each edge $e=uv$ thus possesses a pair of local colors $(c_u(e), c_v(e))$.

A coloring $\varphi\colon V \to \{1, \dots, k\}$ is a conflict $\{c_v\}$-coloring (or single-conflict coloring) if for every edge $e=uv$, it holds that

$(\varphi(u), \varphi(v)) \neq (c_u(e), c_v(e)).$

The single-conflict chromatic number $\chi_{\rm sc}(G)$ (also denoted $\chi_{\nleftrightarrow}(G)$, $\chi_\leftrightarrow(G)$, or $\chi_{\rm sc}$ in the literature) is the minimum $k$ such that for every local $k$-partition, such a coloring exists. For $r$-uniform hypergraphs $H=(V,E)$, a local $k$-partition gives each vertex $v$ a map $c_v:E(v)\to\{1,\dots,k\}$, so each edge $e=\{u_1,\ldots,u_r\}$ receives an $r$-tuple $(c_{u_1}(e),\ldots, c_{u_r}(e))$; $\varphi$ avoids $e$ if for some $i$, $\varphi(u_i) \ne c_{u_i}(e)$, i.e., the color vector avoids matching the forbidden conflict tuple on $e$ (Dvořák et al., 2018, Casselgren et al., 11 Jan 2026, Casselgren et al., 17 Sep 2025).

This coloring type generalizes separation choosability and adaptable choosability:

• Adaptable choosability $ch_{\rm ad}(G)$: requires for every $k$-list assignment and $E \to \{1,\dots,k\}$ edge-coloring, a vertex coloring avoiding $c(u)=c(v)=f(uv)$ on any edge $uv$.
• Separation choosability $ch_{\rm sep}(G)$: for every $k$-list assignment with $|L(u)\cap L(v)|\leq 1$ on $uv$, $G$ is $L$-colorable.

Inequalities $$\chi_{\rm sc}(G)\ge ch_{\rm ad}(G) \ge ch_{\rm sep}(G)$$ always hold (Dvořák et al., 2018, Casselgren et al., 17 Sep 2025).

2. Structural and Extremal Results

Degeneracy and General Upper Bounds

For $d$-degenerate graphs with $n$ vertices and edge multiplicity $\mu \leq \log\log n$, Bradshaw–Masařík proved: $\chi_{\rm sc}(G) = O(\sqrt{d}\log n)$ For general multiplicity $\mu$, the best bound is

$$\chi_{\rm sc}(G)\leq \left\lceil \sqrt{d}\cdot 2^{\frac{\mu}{2}+2}\sqrt{\mu}\sqrt{1+\ln((d+1)\Delta)} \right\rceil$$

where $\Delta$ is the maximum degree (Bradshaw et al., 2021). The proof leverages degeneracy-based orientation, random inventory assignment, and the Lovász Local Lemma (and Moser–Tardos algorithmic LLL for constructivity).

A prior approach for topological surfaces established (for Euler genus $g$ and simple graphs): $\chi_{\rm sc}(G)\leq C(g+1)^{1/4}\log(g+2)$ and more generally for multigraphs with $m$ edges and maximum multiplicity $\mu$: $\chi_{\rm sc}(G)\leq C'(\mu m)^{1/4}\log(\mu m)$ These bounds are sharp up to logarithmic factors—complete graphs have $\chi_{\rm sc}(K_n)\geq \sqrt{n}$, and for complete multigraphs the lower bound is $\Omega(\sqrt{\mu n/\log(\mu n)})$ (Dvořák et al., 2018).

Classical Families

• Planar Graphs: If $G$ is planar, $\chi_{\rm sc}(G)\le 4$ via orientation arguments (as planar graphs are 3-degenerate) (Dvořák et al., 2018). For single-conflict (open-neighborhood conflict-free) coloring, tight results are known: $\chi_{\rm CF}(G)\le 6$ for all planar graphs, with the extremal bounds established using structure-theoretic decompositions and contractions, and explicit inductive arguments for outerplanar graphs yielding $\chi_{\rm CF}(G)\leq 4$ (Bhyravarapu et al., 2019).
• Kneser Graphs: For $K(n,k)$, $\chi_{\rm CF}(K(n,k))=k+2$ for $n\geq k(k+1)^2+1$, both upper and lower bounds shown via explicit coloring and hitting-set constructions (Bhyravarapu et al., 2019).
• String Graphs: For string graph $G$ with classical chromatic number $\chi(G)=t$, $\chi_{\rm CF}(G)=O(t^2\log n)$ (Keller et al., 2017).

Graph Class	$\chi_{\rm sc}$ or $\chi_{\rm CF}$ Upper Bound	Reference
$d$-degenerate	$O(\sqrt{d}\log n)$	(Bradshaw et al., 2021)
Planar	$4$ ($\chi_{\rm sc}$), $6$ ($\chi_{\rm CF}$)	(Dvořák et al., 2018, Bhyravarapu et al., 2019)
Outerplanar	$4$ ($\chi_{\rm CF}$)	(Bhyravarapu et al., 2019)
Kneser $K(n,k)$	$k+2$ (if $n\ge k(k+1)^2+1$)	(Bhyravarapu et al., 2019)
Embeddable genus $g$	$O(g^{1/4}\log g)$	(Dvořák et al., 2018)

3. Relations to Adaptable and Separation Choosability

A local $k$-partition gives rise to conflict tuples corresponding to list assignments and forbidden edge labels. The following chain holds for every (multi)graph $G$: $$\chi_{\rm sc}(G) \ge ch_{\rm ad}(G) \ge ch_{\rm sep}(G)$$ There exist graphs (for every $k$) with arbitrarily large gaps between $\chi_{\rm sc}$, $ch_{\rm ad}$, $ch_{\rm sep}$, and $ch(G)$ (Casselgren et al., 17 Sep 2025). For example, $K_n$ has $\chi_{\rm sc}(K_n)$ substantially less than $ch(K_n)$. Constructions exist where $$ch_{\rm sep}(G)=2 < ch_{\rm ad}(G)=\chi_{\rm sc}(G)=3$$, and explicit planar multigraphs with $(ch_{\rm sep}, ch_{\rm ad}, \chi_{\rm sc})=(3,3,4)$ (Casselgren et al., 17 Sep 2025).

Within planar graphs, a no-gap theorem precludes $(ch_{\rm sep}, ch_{\rm ad}, \chi_{\rm sc})=(4,4,4)$ except as described above, and $(3,3,4)$ remains open for simple planars.

4. Algorithmic and Probabilistic Techniques

Constructions for $O(\sqrt{d}\log n)$ colorings invoke randomized inventory assignment per vertex, deletion of colors violating forbidden pairs, and application of LLL to control the exponentially small probability of failure at each vertex (Bradshaw et al., 2021). Algorithmic versions use the Moser–Tardos resampling method, with local event dependencies and efficient expected runtime.

Distributed variants, as in the LOCAL model, frame single-conflict coloring as a two-round list/color-reduction process; for maximum outdegree $\beta$, list sizes of $$\Omega(\beta^2(\log \beta + \log\log m + \log\log |\mathcal{C}|))$$ suffice for deterministic completion in two rounds, matching earlier Linial-style color reduction but for single-conflict constraints (Maus et al., 2020).

For $r$-uniform hypergraphs, threshold-type results are governed by the balance between edge density and available palette size; for random conflict-tuple assignments, the sharp threshold for $K_n$ is at $k=\Theta(\sqrt{n/\log n})$. For general $r$, palette sizes $k\geq (r+\delta)^{1/r}(d/\ln d)^{1/r}$ suffice for $d$-degenerate $r$-uniforms (Casselgren et al., 11 Jan 2026).

5. Generalizations and Variants

Hypergraphs

Single-conflict coloring generalizes naturally. Each vertex $v$ in $r$-uniform $H=(V,E)$ is assigned $c_v:E(v)\to\{1,\dots,k\}$; a coloring $\varphi:V\to\{1,\dots,k\}$ is proper if, for every $e=\{u_1,\dots,u_r\}$, $$(\varphi(u_1),\dots,\varphi(u_r)) \neq (c_{u_1}(e), \ldots, c_{u_r}(e))$$. The single-conflict chromatic number $\chi_{\rm sc}(H)$ denotes the global minimum $k$ allowing all local $k$-partitions to be avoided. Threshold phenomena for random conflict assignments parallel random $k$-SAT scaling (Casselgren et al., 11 Jan 2026).

Variants

• Conflict-free coloring on open/closed neighborhoods: For open neighborhoods, the conflict-free chromatic number $\chi_{\rm CF}(G)$ is the minimum $k$ so that every $v$ has a neighbor whose color is unique in its open neighborhood. This is NP-complete and admits sharp planar, outerplanar, and Kneser-type bounds (Bhyravarapu et al., 2019).
• Proper conflict-free coloring: Requires a proper coloring with additional uniqueness-of-color-in-neighbor constraint, with explicit bounds for planar large-girth graphs achieved via greedy augmentations and discharge (Anderson et al., 2024).
• Strong conflict-free coloring: For $k=1$, coincides with the perfect dominating set; algorithms parameterized by treewidth are fixed-parameter tractable (Agrawal et al., 2019).

6. Open Problems and Future Directions

Key open questions include:

• Is the $O(\sqrt{d} \log n)$ bound for $d$-degenerate simple graphs optimal, or can the logarithmic factor be removed?
• For hypergraphs, does a similar sharp threshold for $\chi_{\rm sc}$ hold for general (not only linear or sparse) $r$-uniforms, and can palette sparsification be generalized?
• For specific planar structures, is there a simple planar $G$ with $(ch_{\rm sep},ch_{\rm ad},\chi_{\rm sc})=(3,3,4)?$
• How large can the gap between separation/adaptable and single-conflict chromatic numbers be, particularly in linear hypergraphs (Casselgren et al., 17 Sep 2025, Casselgren et al., 11 Jan 2026)?
• Are there deterministic polynomial-time algorithms matching the probabilistic upper bounds, especially for the surface genus case (Bradshaw et al., 2021, Dvořák et al., 2018)?

Further, the structural characterization of graphs (or hypergraphs) with $\chi_{\rm sc}(G)=k$ for small $k$ remains incomplete, with only partial results for $k=2$ (Casselgren et al., 17 Sep 2025).

7. Connections and Broader Context

Single conflict coloring is positioned at the intersection of list coloring, DP-coloring, and local avoidance constraints. The hierarchy

$$\chi(G)\geq \chi_{\rm DP}(G) \geq \chi_{\rm sc}(G)\geq ch_{\rm ad}(G)\geq ch_{\rm sep}(G)$$

provides a stratified perspective for investigating robustness and flexibility of vertex colorings under adversarial and combinatorial constraints.

Algorithmically, developments link probabilistic combinatorics (the Lovász Local Lemma, sharp thresholds) with distributed and fixed-parameter paradigms. The emergence of sharp transition phenomena in uniform hypergraphs, the impact of palette sparsification, and gaps between list-type parameters are central current research themes (Casselgren et al., 11 Jan 2026, Casselgren et al., 17 Sep 2025, Maus et al., 2020).

Open problems in tractability, chromatic gaps, and explicit characterizations suggest further research directions with implications for structural graph theory, distributed algorithms, and the theory of graph colorings under local and global forbidden configurations.