Frankl's conjecture for bipartite graphs with pendant vertices
Statement
Let be a bipartite graph, and call a vertex pendant when it has degree one. Frankl's pendant-vertex conjecture. Every bipartite graph with at least one pendant vertex satisfies Frankl's conjecture. The source places this among graph-theoretic formulations equivalent to the union-closed sets conjecture; it is consequently open in general, while the paper proves related statements for particular graph structures.
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.