Connectivity conjecture for Hamilton cycles in hypergraph line graphs
Statement
For an integer , a rank hypergraph is a hypergraph whose edges have size at most . Its line graph is the graph whose vertices represent hypergraph edges, with adjacency when the corresponding hyperedges intersect. A graph is -connected if deleting fewer than vertices leaves it connected.
Hypergraph line-graph connectivity conjecture. For any , there is an integer such that every -connected line graph of a rank hypergraph is Hamiltonian.
The conjecture was recently proposed in the cited work and is open in the generality stated. The paper proves that every -connected line graph of a rank 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.