Alon–Spencer conjecture on non-star-forest intersection families
Statement
A graph is a star-forest if each of its connected components is a star. For a graph , an -intersecting family on is a family of subgraphs of such that the edge intersection of any two members contains a copy of .
Alon–Spencer conjecture. There exists some constant such that if is a fixed graph that is not a star-forest and is an -intersecting family on , then
This conjecture predicts a uniform improvement over the one-half density for intersecting families whenever is not a star-forest. The source presents the claim as a more general conjecture connected to the proposed optimality of the Christofides bound; no resolution is given.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.