Kostochka et al.'s super-neighborhood cycle conjecture for bigraphs
Statement
A bigraph is a bipartite graph with an ordered vertex partition. For a set , let be the vertices adjacent to at least two vertices of . The graph is snp if, for every with , and is -connected.
Kostochka et al.'s conjecture. If a bigraph is snp, then there is a cycle containing all vertices of .
This is the graph-theoretic form of the conjectured equivalence between the super-neighborhood property and super-pancyclicity of hypergraphs. The conjecture is known for , while the general case remains open.
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.