← All problems

Eventual equality of list colorings and colorings for edgeless graphs

5 years old · traced to

Let K‾n\overline{K}_n be an unlabeled, edgeless graph on nn vertices. The functions Pℓ(K‾n,k)P_{\ell}(\overline{K}_n,k) and P(K‾n,k)P(\overline{K}_n,k) count, respectively, unlabeled list colorings and unlabeled proper colorings with kk colors.

Eventual equality conjecture. For each n∈Nn \in \mathbb{N}, there is an N∈NN \in \mathbb{N} such that

Pℓ(K‾n,k)=P(K‾n,k)P_{\ell}(\overline{K}_n,k)=P(\overline{K}_n,k)

whenever k≥Nk \geq N.

The conjecture concerns disconnected unlabeled graphs with repeated isomorphic connected components. The preceding discussion notes that equality can fail for small values of kk, while asserting that the two counting functions should eventually agree for every fixed nn.

References

2 papers in this index state this conjecture (2021–2024). The statement above is taken from the most recent of them; the others are arXiv:2102.10916.

Source: Hemanshu Kaul and Jeffrey A. Mudrock, “Counting List Colorings of Unlabeled Graphs”, arXiv:2409.06063 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.