ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG 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 GG.

Frankl's graph conjecture. Each bipartition class of GG 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 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.