ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an integer r≥2r\geq 2, a rank rr hypergraph is a hypergraph whose edges have size at most rr. Its line graph is the graph whose vertices represent hypergraph edges, with adjacency when the corresponding hyperedges intersect. A graph is ϕ(r)\phi(r)-connected if deleting fewer than ϕ(r)\phi(r) vertices leaves it connected.

Hypergraph line-graph connectivity conjecture. For any r≥2r\geq 2, there is an integer ϕ(r)\phi(r) such that every ϕ(r)\phi(r)-connected line graph of a rank rr hypergraph is Hamiltonian.

The conjecture was recently proposed in the cited work and is open in the generality stated. The paper proves that every 5252-connected line graph of a rank 33 hypergraph is Hamiltonian, which is partial progress toward the conjecture.

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.