Colored Linear Orderings

• Colored linear orderings are mathematical structures that merge a total order with a color mechanism—using unary predicates, ordered labels, or order-preserving maps.
• They appear in diverse contexts such as model theory, chain enumerations, hypergraph colorings, and graph reachability, each imposing specific order/color conditions.
• Key results include explicit enumerative formulas, complexity thresholds in hypergraph coloring, and classification theorems for finite and homogeneous colored orders.

Colored linear orderings denote several mathematically distinct structures sharing an ordered substrate and a color apparatus. In one usage, a linear order is expanded by unary predicates, yielding a colored order in the model-theoretic sense. In another, a chain is colored by weakly or strictly order-preserving maps subject to a threshold on designated positions. A third usage orders the colors themselves: an LO $k$-coloring of an $r$-uniform hypergraph assigns values in $\{1,\dots,k\}$ so that each edge has a unique maximum. Related ordered-color frameworks also appear in graph sparsity theory, forbidden ordered-pattern characterizations of colorability, shuffle constructions over $(\mathbb Q,<)$, and the classification of homogeneous colored orders (Beck et al., 2019, Nakajima et al., 2022, Tanović et al., 2018, Gonzalez, 15 Apr 2026).

1. Core meanings and formal settings

The common core is the interaction between a total order and a coloring mechanism, but the direction of interaction varies by field. Sometimes the order is primary and colors are unary predicates on points; sometimes the colors themselves are linearly ordered labels; sometimes an ordering of vertices is used to control graph-theoretic reachability or to forbid particular ordered patterns. This suggests that “colored linear ordering” is not a single standard object but a family of order-sensitive color formalisms.

Framework	Underlying object	Order/color condition
Model-theoretic colored order	$(M,<,\{P_i\}_{i\in I})$	unary predicates expand a linear order
Chain order polynomial	chain $C_n$	weakly or strictly increasing maps with a celeste threshold
LO hypergraph coloring	$r$-uniform hypergraph	every edge has a unique maximum color
Homogeneous colored order	countable colored order	finite partial isomorphisms extend to automorphisms

In the model-theoretic formulation, a colored order is a structure $\mathcal M=(M,<,\{P_i\}_{i\in I})$, where each $P_i$ is a unary subset of $M$. In the chain-enumerative formulation, a bicolored poset $r$0 has a partition $r$1 into celeste and silver elements, and one counts order-preserving maps $r$2 satisfying a threshold on celeste elements. In the hypergraph formulation, an LO $r$3-coloring is a function $r$4 such that the multiset of colors on each edge has a unique maximum. For $r$5, this is equivalently the rule that if two vertices in an edge share a color, then the third must receive a strictly larger color (Tanović et al., 2018, Beck et al., 2019, Nakajima et al., 2022, Gonzalez, 15 Apr 2026).

2. Chains, thresholds, and bivariate order polynomials

For a finite poset $r$6, classical order polynomials count order-preserving or strictly order-preserving maps into a chain $r$7. The bivariate refinement introduces a partition $r$8, with $r$9 the celeste elements, and counts maps satisfying both monotonicity and a threshold condition on $\{1,\dots,k\}$0. For integers $\{1,\dots,k\}$1 and $\{1,\dots,k\}$2,

$\{1,\dots,k\}$3

counts order-preserving $\{1,\dots,k\}$4-maps $\{1,\dots,k\}$5 with $\{1,\dots,k\}$6 for all $\{1,\dots,k\}$7, while

$\{1,\dots,k\}$8

counts strictly order-preserving $\{1,\dots,k\}$9-maps with $(\mathbb Q,<)$0 for all $(\mathbb Q,<)$1 (Beck et al., 2019).

When $(\mathbb Q,<)$2 is the chain $(\mathbb Q,<)$3, the data collapse to the position of the minimal celeste element. If $(\mathbb Q,<)$4 is minimal celeste, then the weak case imposes $(\mathbb Q,<)$5, and the strict case imposes $(\mathbb Q,<)$6. The classical chain formulas are

$(\mathbb Q,<)$7

Their bivariate analogues are

$(\mathbb Q,<)$8

and

$(\mathbb Q,<)$9

Thus, for chains, colored linear orderings admit explicit binomial-sum enumerations depending only on the first celeste position.

The same paper proves a decomposition over linear extensions for general posets and a bivariate reciprocity theorem,

$(M,<,\{P_i\}_{i\in I})$0

For chains this becomes

$(M,<,\{P_i\}_{i\in I})$1

The reciprocity shift $(M,<,\{P_i\}_{i\in I})$2 distinguishes the bivariate setting from the classical one-variable case. The chain formulas therefore serve both as closed-form counts and as the simplest instance of a broader reciprocity theory for order-preserving colorings (Beck et al., 2019).

3. Linearly ordered colorings of hypergraphs

In hypergraph theory, a linearly ordered coloring is an LO $(M,<,\{P_i\}_{i\in I})$3-coloring of an $(M,<,\{P_i\}_{i\in I})$4-uniform hypergraph $(M,<,\{P_i\}_{i\in I})$5: a function $(M,<,\{P_i\}_{i\in I})$6 such that every edge has a unique maximum color. Equivalently, for $(M,<,\{P_i\}_{i\in I})$7, if two vertices in an edge share the same color, then the third must have a strictly larger color. This is stronger than classical non-monochromatic coloring, which only excludes all-equal edges. The formalism fits naturally into Promise CSPs: if $(M,<,\{P_i\}_{i\in I})$8 denotes the $(M,<,\{P_i\}_{i\in I})$9-ary template of tuples with a unique maximum, then an LO $C_n$0-coloring is exactly a homomorphism $C_n$1, and the promise problem LO-$C_n$2 vs LO-$C_n$3 is the PCSP $C_n$4 (Nakajima et al., 2022).

For 3-uniform hypergraphs promised to admit an LO $C_n$5-coloring, a polynomial-time, deterministic, constructive algorithm outputs an LO $C_n$6-coloring with

$C_n$7

The method first linearizes the instance by merging vertex pairs forced equal in every LO $C_n$8-coloring, then alternates two types of progress on a linear hypergraph: a Type 1 step colors a large independent set with a new largest color, while a Type 2 step finds a large set meeting each hyperedge in $C_n$9 or $r$0 vertices and colors it with a new smallest color. The dense regime uses the mod-$r$1 system $r$2 and a constant-factor approximation for Max-Ones modulo $r$3; the sparse regime uses graph independent-set approximation. Balancing the two regimes at

$r$4

yields the stated bound (Nakajima et al., 2022).

The complexity boundary is sharp in a different parameter range. For every fixed $r$5 and constant $r$6, given an $r$7-uniform hypergraph that admits an LO $r$8-coloring, it is NP-hard to find an LO $r$9-coloring. More generally, for every fixed $\mathcal M=(M,<,\{P_i\}_{i\in I})$0 and $\mathcal M=(M,<,\{P_i\}_{i\in I})$1, $\mathcal M=(M,<,\{P_i\}_{i\in I})$2 is NP-hard. The proofs use the algebraic PCSP framework of polymorphism minions, minion homomorphisms, free structures, and pp-constructions, and they isolate a structural asymmetry between the regimes $\mathcal M=(M,<,\{P_i\}_{i\in I})$3 and $\mathcal M=(M,<,\{P_i\}_{i\in I})$4. In particular, hardness for $\mathcal M=(M,<,\{P_i\}_{i\in I})$5 cannot be transferred to $\mathcal M=(M,<,\{P_i\}_{i\in I})$6 by gadget reductions because the necessary minion homomorphisms do not exist (Nakajima et al., 2022).

A later development gives a logarithmic approximation for the 3-uniform promised LO $\mathcal M=(M,<,\{P_i\}_{i\in I})$7-colorable case. There is an algorithm that, given a 3-uniform hypergraph $\mathcal M=(M,<,\{P_i\}_{i\in I})$8 with $\mathcal M=(M,<,\{P_i\}_{i\in I})$9 vertices and $P_i$0 edges that admits an LO $P_i$1-coloring, finds an LO $P_i$2-coloring in time $P_i$3, and another that finds an LO $P_i$4-coloring in the same time bound. The core subroutine solves $P_i$5, derives a subset $P_i$6 intersecting each 3-edge in $P_i$7 or $P_i$8 vertices and each 2-edge in exactly $P_i$9 vertex, guarantees $M$0, and then peels such sets layer by layer. A randomized rational nullspace method gives, with probability at least $M$1, an LO-coloring with $M$2 colors (Håstad et al., 2024).

The principal open problem remains the constant-color regime for 3-uniform hypergraphs. The exact complexity of $M$3 for fixed $M$4 is open, and the specific case $M$5 was already highlighted in the STACS’21 line of work. A plausible implication is that the 3-uniform case lies at the point where current combinatorial and algebraic methods cease to align cleanly.

4. Ordered vertices in graph theory

A distinct graph-theoretic tradition studies linear orderings of vertices rather than colorings of vertices by ordered labels. For a graph $M$6 and a linear ordering $M$7 of $M$8, weak $M$9-reachability $r$00 and strong $r$01-reachability $r$02 determine the generalized coloring numbers

$r$03

Optimizing over $r$04 gives $r$05 and $r$06. These parameters interpolate between degeneracy $r$07, treewidth $r$08, and treedepth, and they govern acyclic and star colorings through greedy procedures based on reachability layers (Heuvel et al., 2019).

A central question is whether one can choose a single ordering that is simultaneously good for all radii. The main uniform-ordering theorem gives an affirmative answer up to explicit loss: for any graph $r$09, there exists an ordering $r$10 such that for all $r$11,

$r$12

A more general simultaneous-control theorem treats multiple graphs on the same vertex set. These results yield new characterizations of bounded expansion and nowhere dense classes in terms of one ordering per graph or per subgraph. They also show an inherent limitation: no single ordering can be optimal for two different radii in general, and some deterioration is unavoidable (Heuvel et al., 2019).

A second ordered-graph framework describes hereditary properties by forbidden ordered patterns. A graph $r$13 is $r$14-colorable if and only if there exists a linear ordering $r$15 on $r$16 with no $r$17 vertices

$r$18

such that $r$19 for every $r$20. The ordered obstruction is the straight path $r$21. The same paper shows that every finite forbidden circular-order description can be translated into a finite forbidden linear-order description via the operator $r$22. For $r$23, the following are equivalent: $r$24 admits a circular ordering $r$25 such that $r$26; $r$27 admits a $r$28-free linear ordering; and $r$29, where $r$30 is the circular chromatic number (Guzmán-Pro et al., 2021).

These two theories use different notions of “colored linear ordering,” but both convert coloring constraints into structural statements about a single vertex order. In sparse graph theory, the order controls reachability; in forbidden-pattern theory, it controls the presence of monotone obstructions.

5. Colored orders in model theory

In model theory, a colored order is a linearly ordered first-order structure $r$31 whose language contains unary predicates interpreted as colors. Rubin’s program asks when a linearly ordered structure is not much more complicated than such a colored order. A precise answer is obtained through a hierarchy of tameness conditions. Linear finiteness (LF) bounds the number of $r$32-types realized above an initial segment. Linear binarity (LB) says that, for an increasing tuple $r$33, the full type is determined by consecutive pair types. Strong linear binarity (SLB) strengthens this to automorphism gluing over arbitrary initial parts. Rubin’s binarity (RB) is still stronger. The implications are strict: $r$34 Moreover, an $r$35-saturated linearly ordered structure satisfies RB if and only if it is definitionally equivalent to a colored order (Tanović et al., 2018).

The same work introduces the ccel-reduct $r$36, which names all unary definable sets and all definable convex equivalence relations. Its main structural theorem states that $r$37 satisfies SLB if and only if $r$38 is definitionally equivalent to $r$39; equivalently, $r$40 is, up to definitional equivalence, a theory of colored orders expanded by definable convex equivalence relations. Under SLB, every formula is equivalent modulo $r$41 to a Boolean combination of $r$42-convex formulas. These are built from unary conditions and order constraints expressed through successor and predecessor classes of definable convex equivalence relations.

At the LF level one already gets strong geometric consequences. Every $r$43-definable convex subset of $r$44 has an explicit successor-class form such as

$r$45

and monotone binary relations decompose into finite disjunctions of such pieces. Definable unary functions are finite unions of successor-class maps. After naming all unary definable sets, convex equivalence relations, and the basic relations

$r$46

the complete theory eliminates quantifiers. The resulting picture is that colored orders and their convex-equivalence expansions have a highly stratified yet explicitly describable geometry of definable sets (Tanović et al., 2018).

6. Finite colored linear orders and Ehrenfeucht–Fraïssé classification

For finite colored linear orders, the natural equivalence notion is $r$47-equivalence under the $r$48-move Ehrenfeucht–Fraïssé game. If $r$49 and $r$50 are colored linear orders over the same color set, then $r$51 means Duplicator wins the $r$52-move game preserving both order and colors. The key invariant is the $r$53-character of a point $r$54, namely

$r$55

where $r$56 is the color of $r$57. The fundamental theorem states that $r$58 if and only if the multisets $r$59 and $r$60 agree for every color $r$61 (Mwesigye et al., 2017).

At the level of $r$62, the classification is completely explicit. For $r$63 colors, one associates to a finite colored linear order a $r$64-configuration consisting of points $r$65 and $r$66, where the $r$67 record the first appearance of the $r$68-th new color from the left and the $r$69 the last appearance of the $r$70-th new color from the right. A realizability criterion is

$r$71

Together with the sets $r$72 of colors occurring in each interval between consecutive $r$73-points, this completely determines the $r$74-class. The families $r$75 classify the $r$76-classes of finite $r$77-colored linear orders.

This classification yields an algorithmic reduction to canonical form. Any finite colored string has a $r$78-equivalent $r$79-optimal substring obtained by computing the colored $r$80-configuration, computing each $r$81, and then replacing each interval $r$82 by a minimal interval in which each color from $r$83 appears exactly once. The result is a substring of the original structure and is optimal in its $r$84-class. The exact least upper bound on lengths of optimal representatives of $r$85-classes with $r$86 colors is $r$87.

At the level of $r$88, the structure becomes substantially more intricate. A 2-colored string of length $r$89 is constructed that is $r$90-optimal because all its 2-characters are distinct, and a longer example of length $r$91 is $r$92-optimal despite repeated 2-characters. The paper uses De Bruijn-type constructions and directed graphs of character transitions to control these phenomena. This shows that, beyond $r$93, local repetition of characters no longer suffices to determine reducibility; global transition constraints matter (Mwesigye et al., 2017).

7. Countable shuffles, homogeneous colored orders, and enumeration

A different countable theory begins with shuffles over the rationals. For a non-empty countable set $r$94 of linear orders, a dense $r$95-coloring $r$96 assigns to each rational a color $r$97 so that every color class is dense in $r$98. Replacing each $r$99 by a copy of the order $\{1,\dots,k\}$00 yields the shuffle

$\{1,\dots,k\}$01

Skolem’s theorem gives existence and uniqueness of dense colorings up to an automorphism of $\{1,\dots,k\}$02, so $\{1,\dots,k\}$03 depends only on $\{1,\dots,k\}$04 up to isomorphism. For this class, a Cantor–Schröder–Bernstein phenomenon holds: if two countable shuffles embed as convex subsets into each other, then they are order-isomorphic (Srivastava et al., 2024).

Homogeneous colored linear orders admit a finite-skeleton classification. A countable colored linear ordering $\{1,\dots,k\}$05 is homogeneous if every isomorphism between finitely generated colored substructures extends to an automorphism. Such an order is homogeneous if and only if there exist pairwise disjoint subsets $\{1,\dots,k\}$06 and $\{1,\dots,k\}$07 such that each open interval $\{1,\dots,k\}$08 is isomorphic to the color shuffle $\{1,\dots,k\}$09, and each $\{1,\dots,k\}$10 occurs as a single isolated point of color $\{1,\dots,k\}$11. Thus homogeneous colored orders are finite unions of color-dense open intervals together with finitely many isolated colored points, with colors not repeated across different components. The paper proves that the number $\{1,\dots,k\}$12 of isomorphism types of countable homogeneous colored linear orders in $\{1,\dots,k\}$13 colors has exponential generating function

$\{1,\dots,k\}$14

The first values are

$\{1,\dots,k\}$15

and, with

$\{1,\dots,k\}$16

one has

$\{1,\dots,k\}$17

The proportion of homogeneous colored orders using all $\{1,\dots,k\}$18 colors tends to $\{1,\dots,k\}$19 (Gonzalez, 15 Apr 2026).

The same finite-skeleton method approximates $\{1,\dots,k\}$20-homogeneity through the relational notions $\{1,\dots,k\}$21-homogeneity. Here the language records exact numbers of predecessors and successors and exact finite distances by predicates $\{1,\dots,k\}$22, $\{1,\dots,k\}$23, and $\{1,\dots,k\}$24. A linear ordering is $\{1,\dots,k\}$25-homogeneous if this expansion is homogeneous, and $\{1,\dots,k\}$26-homogeneity is exactly $\{1,\dots,k\}$27-homogeneity. For finite $\{1,\dots,k\}$28, the class is finite up to isomorphism, and its members are very closely related to homogeneous colored linear orders with finitely many colors. If $\{1,\dots,k\}$29, the number $\{1,\dots,k\}$30 of $\{1,\dots,k\}$31-homogeneous orders satisfies

$\{1,\dots,k\}$32

and explicit recurrence and Stirling-number formulas are given. A later paper places these classes in a computability-theoretic hierarchy: $\{1,\dots,k\}$33-homogeneous orders are always relatively $\{1,\dots,k\}$34-categorical, the set of $\{1,\dots,k\}$35-homogeneous orderings is $\{1,\dots,k\}$36-complete, and the set of weakly $\{1,\dots,k\}$37-homogeneous orderings is $\{1,\dots,k\}$38-complete (Calvert et al., 29 Sep 2025).

Taken together, these results show that countable colored linear orderings can be both rigid and enumerable. Dense shuffles over $\{1,\dots,k\}$39 exhibit a strong convex-embedding rigidity, while homogeneous colored orders reduce to finite combinatorics despite being generally infinite structures. An open enumerative problem is whether the bound $\{1,\dots,k\}$40 holds for the $\{1,\dots,k\}$41-homogeneous counts (Gonzalez, 15 Apr 2026).