Graph Coloring and Function Simulation
Abstract
We prove that every partial function with finite domain and range can be effectively simulated through sequential colorings of graphs. Namely, we show that given a finite set S=\0,1,…,m-1\ and a number n ≥ \m,3\, any partial function :S^p S^q (i.e. it may not be defined on some elements of its domain S^p) can be effectively (i.e. in polynomial time) transformed to a simple graph G_,n along with three sets of specified vertices X = \x_0,x_1,…,x_p-1\, \ \ Y = \y_0,y_1,…,y_q-1\, \ \ R = \0,1,…,n-1\, such that any assignment σ_0: X R \0,1,…,n-1\ with σ_0(i)=i for all 0 ≤ i < n, is uniquely and effectively extendable to a proper n-coloring σ of G_,n for which we have (σ(x_0),σ(x_1),…,σ(x_p-1))=(σ(y_0),σ(y_1),…,σ(y_q-1)), unless (σ(x_0),σ(x_1),…,σ(x_p-1)) is not in the domain of (in which case σ_0 has no extension to a proper n-coloring of G_,n).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.