ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph is a star-forest if each of its connected components is a star. For a graph HH, an HH-intersecting family on KtK_t is a family of subgraphs of KtK_t such that the edge intersection of any two members contains a copy of HH.

Alon–Spencer conjecture. There exists some constant ϵ>0\epsilon > 0 such that if HH is a fixed graph that is not a star-forest and F\mathcal F is an HH-intersecting family on KtK_t, then

∣F∣<(12−ϵ)2(t2).|\mathcal F| < \left(\frac 12 - \epsilon\right)2^{\binom t2}.

This conjecture predicts a uniform improvement over the one-half density for intersecting families whenever HH 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.