Asymptotic independent-transversal packing bounds for list and correspondence covers
Asymptotic independent-transversal packing bounds for list and correspondence covers
For each , let and 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 .
Independent-transversal packing conjecture.
as .
The source records the general upper bound , so the conjecture asks for an asymptotic improvement to leading constant . It remains open.
Sources & referencesView supporting material
Primary source
Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies and Ross J. Kang, “Packing list-colourings”, arXiv:2110.05230 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.