ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A stable set in a graph is a set of vertices no two of which are adjacent; it is maximal if it is maximal under inclusion. Let GG be a finite graph with at least one edge. Graph formulation of the union-closed sets conjecture. There are two adjacent vertices, each belonging to at most half of the maximal stable sets. This is an equivalent formulation of Frankl's union-closed sets conjecture. The claim is true for non-bipartite graphs, so the unresolved case is restricted to bipartite graphs.

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.