The list color function threshold conjecture for complete bipartite graphs
Let be the complete bipartite graph with parts of sizes and , and let denote the list color function threshold of a graph .
List color threshold conjecture.
A lower bound of order is known, while this conjecture asserts a matching upper bound and therefore determines the asymptotic growth of the threshold.
References
- Hemanshu Kaul, Akash Kumar, Andrew Liu, Jeffrey A. Mudrock, Patrick Rewers, Paul Shin, Michael Scott Tanahara and Khue To, “Bounding the List Color Function Threshold from Above”, arXiv:2207.04831 (2022).
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.