Kamat's cross-intersection conjecture for independent sets of graphs
Statement
Let be a graph, let be the family of independent sets of , and let be its -th level. Two subfamilies are cross-intersecting if every member of one intersects every member of the other. Write for the minimum base size.
Kamat's conjecture. If and are cross-intersecting, then
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.