ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let IG\mathcal{I}_G be the family of independent sets of GG, and let IG(r)\mathcal{I}_G^{(r)} be its rr-th level. Two subfamilies are cross-intersecting if every member of one intersects every member of the other. Write μ(IG)\mu(\mathcal{I}_G) for the minimum base size.

Kamat's conjecture. If μ(IG)≥2r\mu(\mathcal{I}_G)\geq 2r and A,B⊆IG(r)\mathcal{A},\mathcal{B}\subseteq\mathcal{I}_G^{(r)} are cross-intersecting, then

∣A∣+∣B∣≤∣IG(r)∣.|\mathcal{A}|+|\mathcal{B}|\leq |\mathcal{I}_G^{(r)}|.

The source presents this as an analogue of the Holroyd–Talbot conjecture and does not state that it has been resolved.

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.