Fuentes–Kamat conjecture on Erdős–Ko–Rado subfamilies of perfect matchings
Fuentes–Kamat conjecture on Erdős–Ko–Rado subfamilies of perfect matchings
Let be the graph with vertex set
and edge set
Let be the family of subsets of that contain exactly vertices and span exactly edges, equivalently, that contain disjoint edges and isolated vertices. For a family and an element , write ; the family is EKR if some satisfies for every intersecting subfamily . Fuentes–Kamat conjecture. For non-negative integers satisfying , is EKR. This conjecture concerns an Erdős–Ko–Rado property for subfamilies of subsets associated with a perfect matching; the source notes that Fuentes and Kamat had previously conjectured this statement and proved it for a certain range of parameters, while the general assertion is presented here as the conjectural claim.
Sources & referencesView supporting material
Primary source
Dániel T. Nagy, “An Erdős-Ko-Rado type theorem for subgraphs of perfect matchings”, arXiv:2407.17455 (2024).
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.