Frankl's bipartite graph conjecture
Statement
Let be a bipartite graph with at least one edge, and consider its two bipartition classes. A vertex is low-frequency if it lies in at most half of the maximal stable sets of .
Frankl's graph conjecture. Each bipartition class of contains a low-frequency vertex.
This is described as a reformulation of the union-closed sets conjecture. The source gives no resolution.
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.