ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A bigraph is a bipartite graph G=(X,Y)G=(X,Y) with an ordered vertex partition. For a set S⊆XS\subseteq X, let Λ2(S)\mathsf{\Lambda}^2(S) be the vertices adjacent to at least two vertices of SS. The graph is snp if, for every S⊆XS\subseteq X with ∣S∣≥3|S|\geq 3, ∣Λ2(S)∣≥∣S∣|\mathsf{\Lambda}^2(S)|\geq |S| and G[S∪Λ2(S)]G[S\cup\mathsf{\Lambda}^2(S)] is 22-connected.

Kostochka et al.'s conjecture. If a bigraph G=(X,Y)G=(X,Y) is snp, then there is a cycle containing all vertices of XX.

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 ∣X∣∈{3,4,5,6,7}|X|\in\{3,4,5,6,7\}, 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 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.