Common-card bound for bipartite and non-bipartite graphs
Statement
Let be a bipartite graph and a non-bipartite graph, both on vertices. A common card is an unlabeled vertex-deleted subgraph occurring in the decks of both graphs. Bipartiteness conjecture. For large enough, the number of common cards between and is at most . The conjecture proposes the expected sharp lower bound on the number of cards needed to distinguish bipartite from non-bipartite graphs; the source does not state whether it has been resolved.
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.