The two-component-intersection extremal conjecture
Statement
Let , and let be a family of graphs on .
Two-component-intersection conjecture. If the intersection of any two graphs in has at most two components, then
The proposed extremal example consists of all graphs containing all but one edge of a fixed -cycle; the authors also mention variants involving an -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.