Pinnable covering conjecture for hypergraphs of different uniformities
Statement
Let be an -uniform hypergraph and an -uniform hypergraph on the same vertex set, so . Assume that and are cross-intersecting. A hypergraph is pinnable if it has a set meeting every edge in exactly one vertex.
General pinnable covering conjecture. If is pinnable, then
The source proves this when , but leaves the general case open.
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.