The limiting function conjecture for minimal H-factors
Let be a graph, let denote its maximal density parameter, and let be the minimal weight of an -factor in the random weighted complete graph . Here alpha a[[0](#reference-0),[1](#reference-1)] is the proportion of vertices not covered. Limiting function conjecture. There is a continuous decreasing function f_H:[[0](#reference-0),[1](#reference-1)]\to \mathbb{R} such that
The preceding theorem gives the correct order of magnitude and sharp concentration for , but does not establish existence of this normalized limit; determining the function remains open.
References
- Lorenzo Federico and Joel Larsson Danielsson, “Minimal H-factors and covers”, arXiv:2302.12184 (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.