FAT Chromatic Number in Graph Colorings

• FAT chromatic number is a graph invariant defined via fair and tolerant colorings that balance same-color tolerance with equitable cross-class neighbor distribution.
• It incorporates precise bounds such as degree, order, and volume divisibility, and leverages spectral criteria to relate coloring parameters to graph eigenvalues.
• This concept bridges classical chromatic theory with equitable partitioning, opening research avenues in algorithmic complexity and spectral graph analysis.

The FAT chromatic number, denoted $\chi^{\mathrm{FAT}}(G)$, is a graph invariant originating from a relaxation of classical proper coloring, incorporating the dual principles of fairness and tolerance in color assignments. Introduced by Beers and Mulas, Fair and Tolerant (FAT) colorings generalize equitable and proper colorings by allowing each vertex to tolerate a prescribed fraction of same-colored neighbors while distributing the remaining neighbors evenly among other color classes. This non-proper coloration paradigm establishes a new maximal coloring parameter distinct from the chromatic number and sheds light on the interplay between local regularity and global colorability constraints (Beers et al., 21 Oct 2025, Shaebani, 18 Nov 2025).

1. Formal Definitions and Fundamental Properties

Let $G=(V,E)$ be a finite, simple, undirected graph. The standard notation for the degree of a vertex $v$ is $\deg(v)$ and $e(v,S) = |N(v)\cap S|$ for $S\subseteq V$, where $N(v)$ is the neighborhood of $v$.

FAT $k$-Coloring

A FAT $k$-coloring is a coloring $G=(V,E)$0 that partitions $G=(V,E)$1 into nonempty color-classes $G=(V,E)$2 such that for real parameters $G=(V,E)$3, every $G=(V,E)$4 and $G=(V,E)$5:

$G=(V,E)$6

with the normalization constraint $G=(V,E)$7.

• Fairness: Each vertex distributes a fraction $G=(V,E)$8 of its neighbors to each other color class.
• Tolerance: A fraction $G=(V,E)$9 of a vertex's neighbors may share its color.

When $v$0 (and $v$1), the coloring is a proper and equitable coloring.

FAT Chromatic Number

The FAT chromatic number, $v$2, is defined as

$v$3

This parameter is always at least $v$4 due to the trivial coloring, and is at most $v$5 (as each class must be nonempty).

2. Bounds and Structural Constraints

Numerous general and structural bounds on $v$6 have been established:

• Degree Bound: If $v$7, then

$v$8

This is tight for $v$9 [(Beers et al., 21 Oct 2025), Prop. 2.1].

• Order Bound: $\deg(v)$0, with equality if and only if $\deg(v)$1.
• Volume Divisibility: In any FAT $\deg(v)$2-coloring with $\deg(v)$3, all color classes have the same total degree volume:

$\deg(v)$4

Thus, $\deg(v)$5 divides $\deg(v)$6 [(Beers et al., 21 Oct 2025), Prop. 2.8].

• Regular Graphs: For connected $\deg(v)$7-regular $\deg(v)$8, each color class has $\deg(v)$9 vertices and $e(v,S) = |N(v)\cap S|$0 divides $e(v,S) = |N(v)\cap S|$1 [(Beers et al., 21 Oct 2025), Thm. 2.5].
• Relation to Chromatic Number: Every proper $e(v,S) = |N(v)\cap S|$2-coloring is a FAT coloring with $e(v,S) = |N(v)\cap S|$3, so

$e(v,S) = |N(v)\cap S|$4

but strict inequalities in either direction occur.

3. Spectral Criteria

Let $e(v,S) = |N(v)\cap S|$5 be the normalized Laplacian of $e(v,S) = |N(v)\cap S|$6 with spectrum $e(v,S) = |N(v)\cap S|$7, and let $e(v,S) = |N(v)\cap S|$8 be the maximal multiplicity of any eigenvalue.

• Main Theorem: If $e(v,S) = |N(v)\cap S|$9 admits a FAT $S\subseteq V$0-coloring with fairness-parameter $S\subseteq V$1, then $S\subseteq V$2 is an eigenvalue of $S\subseteq V$3 with multiplicity at least $S\subseteq V$4 [(Beers et al., 21 Oct 2025), Thm. 3.4].
• Spectral Bound: This gives

$S\subseteq V$5

with equality for $S\subseteq V$6 where $S\subseteq V$7 [(Beers et al., 21 Oct 2025), Cor. 3.5].

• Regular graphs: For $S\subseteq V$8-regular $S\subseteq V$9, $N(v)$0 is an eigenvalue of the Kirchhoff Laplacian, and $N(v)$1 of the adjacency matrix, with multiplicity at least $N(v)$2 [(Beers et al., 21 Oct 2025), Thm. 3.7].

4. Exact Values for Standard Graph Classes

Some families admit explicit formulas for $N(v)$3:

Graph Class	$N(v)$4 Formula	Comments
Complete $N(v)$5	$N(v)$6	Each vertex its own class
Bipartite, Tree	$N(v)$7	Proper 2-coloring achieves $N(v)$8, $N(v)$9
Cycle $v$0	$v$1 (if $v$2 odd, $v$3); $v$4 (if $v$5 even, $v$6); $v$7 (if $v$8)	See [(Beers et al., 21 Oct 2025), Ex. 2.18]
Petal graph	$v$9	$k$0; proper 3-coloring
Book graph $k$1	$k$2 if $k$3 odd; $k$4 if $k$5 even	Odd/even degree gcd governs the value
Turán $k$6	$k$7	For $k$8, $k$9-regular case

Further, in the edgeless graph $k$0, $k$1 and $k$2 (singleton color classes) (Shaebani, 18 Nov 2025).

5. Relationship with Ordinary Chromatic Number

The FAT chromatic number is not bounded above or below by any function of the ordinary chromatic number $k$3. Explicit constructions demonstrate the unbounded separation in both directions [(Shaebani, 18 Nov 2025), Thms. 2.1–2.2]:

• There exist families with $k$4 fixed and $k$5, and vice versa.
• For example, in the graph $k$6 formed from $k$7 minus a perfect matching, $k$8 but $k$9 [(Shaebani, 18 Nov 2025), Thm. 2.1].
• Conversely, for a graph $G=(V,E)$00 with a large clique and attached pendant triangles, $G=(V,E)$01 while $G=(V,E)$02 is arbitrarily large [(Shaebani, 18 Nov 2025), Thm. 2.2].
• No functions $G=(V,E)$03 exist such that $G=(V,E)$04 or $G=(V,E)$05 for all $G=(V,E)$06.

For disconnected graphs, unbounded gaps are easily achieved by assembling suitable disjoint unions of cliques.

6. Computational Aspects and Algorithmic Considerations

The computational complexity of determining $G=(V,E)$07 remains unresolved. Whether this decision problem is NP-complete, or whether it admits efficient polynomial-time algorithms for general or restricted classes, is posed as an open problem [(Beers et al., 21 Oct 2025), Question 7.2]. A constructive result is that, given a FAT $G=(V,E)$08-coloring, one can merge classes to obtain FAT $G=(V,E)$09-colorings $G=(V,E)$10 with associated parameters, yielding a full lattice of colorings from the maximal irreducible ones [(Beers et al., 21 Oct 2025), Thm. 5.1].

7. Open Problems and Directions

Significant questions remain regarding the FAT chromatic number, many of which are explicitly stated in the literature [(Beers et al., 21 Oct 2025), §7], (Shaebani, 18 Nov 2025):

1. Gap Quantification: For which classes is $G=(V,E)$11 bounded or characterized?
2. Algorithmic Complexity: Is computing $G=(V,E)$12 NP-complete?
3. Probabilistic Behavior: What are typical values of $G=(V,E)$13 for random regular graphs?
4. Relaxed FAT-variants: What can be said for edge/FAT-variants with only tolerance but not fairness?
5. Monotonicity: Does subgraph monotonicity hold, i.e., for $G=(V,E)$14, is $G=(V,E)$15?
6. Spectral Extensions: Can spectral characterization for non-regular graphs be established?
7. Turán Extensions: Can the explicit formula for $G=(V,E)$16 on Turán graphs be extended to all multipartite graphs?
8. Enumerative Questions: Which $G=(V,E)$17 admit exactly $G=(V,E)$18 irreducible FAT colorings for a given $G=(V,E)$19?
9. Parameter Realizability: For fixed $G=(V,E)$20 and $G=(V,E)$21, does there exist $G=(V,E)$22 with such a FAT $G=(V,E)$23-coloring? 10. Simultaneous Maximization: For $G=(V,E)$24, does there exist $G=(V,E)$25 with $G=(V,E)$26 and parameter $G=(V,E)$27 as above?

A plausible implication is that future results on the interplay between $G=(V,E)$28 and spectral graph theory may yield deeper insight into equitable partitioning in complex networks.

8. Illustrative Examples

The following table summarizes computed values for small canonical graphs (Beers et al., 21 Oct 2025, Shaebani, 18 Nov 2025):

Graph	$G=(V,E)$29	Distinguishing Property
$G=(V,E)$30	4	Complete graph: each vertex distinct class
$G=(V,E)$31	2	Path: proper 2-coloring
$G=(V,E)$32	1	Cycle, $G=(V,E)$33 (odd, $G=(V,E)$34)
$G=(V,E)$35	3	Cycle, $G=(V,E)$36
$G=(V,E)$37	2	Cycle, $G=(V,E)$38 (even, $G=(V,E)$39)
$G=(V,E)$40	2	Star (bipartite)

These examples demonstrate the diversity and sometimes counterintuitive values that the FAT chromatic number can take, further underscoring its distinction from the conventional graph chromatic number.

---

For further details and proofs, refer to "Fair and Tolerant (FAT) Graph Colorings" by Beers and Mulas (Beers et al., 21 Oct 2025) and "On Fair and Tolerant Colorings of Graphs" by Shaebani (Shaebani, 18 Nov 2025).