The good-function conjecture for hypergraph matching
Let ) be a hypergraph. A function on the edges of is called good for in the sense of the paper's preceding proposition, which characterizes the weighted matching guarantee used in its algorithmic framework.
Good-function conjecture. If
for every edge of , then is good for .
This conjecture would, in particular, imply the Füredi–Kahn–Seymour conjecture. The supplied context does not provide the full definition of “good” or evidence that the conjecture has been resolved.
References
- Nikhil Bansal and David G. Harris, “Some remarks on hypergraph matching and the Füredi-Kahn-Seymour conjecture”, arXiv:2011.07097 (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.