← All problems

Asymptotic independent-transversal packing bounds for list and correspondence covers

5 years old · traced to

For each DD, let Λℓ⋆(D)\Lambda^\star_\ell(D) and Λc⋆(D)\Lambda^\star_c(D) be the least fold numbers guaranteeing an independent-transversal packing for, respectively, list-covers and correspondence-covers, under the condition that the cover graph has maximum degree at most DD.

Independent-transversal packing conjecture.

Λℓ⋆(D)≤D+o(D)andΛc⋆(D)≤D+o(D)\Lambda^\star_\ell(D) \le D+o(D) \quad\text{and}\quad \Lambda^\star_c(D) \le D+o(D)

as D→∞D\to\infty.

The source records the general upper bound Λℓ⋆(D)≤Λc⋆(D)≤2D+o(D)\Lambda^\star_\ell(D)\le\Lambda^\star_c(D)\le 2D+o(D), so the conjecture asks for an asymptotic improvement to leading constant 11. It remains open.

References
  1. Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies and Ross J. Kang, “Packing list-colourings”, arXiv:2110.05230 (2023).

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.