ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let [n]={1,2,…,n}[n]=\{1,2,\ldots,n\}, and let F\mathcal{F} be a family of graphs on [n][n].

Two-component-intersection conjecture. If the intersection of any two graphs in F\mathcal{F} has at most two components, then

∣F∣≤n+12n⋅2(n2).|\mathcal{F}|\leq \frac{n+1}{2^n}\cdot 2^{\binom{n}{2}}.

The proposed extremal example consists of all graphs containing all but one edge of a fixed nn-cycle; the authors also mention variants involving an (n−1)(n-1)-cycle with a pendant edge. They state that only a much weaker upper bound is currently known.

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.