ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be a positive integer. A U-cycle of isomorphism classes of graphs on kk nodes is a cyclic sequence in which every kk-window represents a distinct isomorphism class of graphs on kk nodes, and every such isomorphism class occurs as a window. Universal-cycle conjecture. For each k≥3k \geq 3, there exists a U-cycle of isomorphism classes of graphs on kk nodes. The conjecture proposes a canonical universal-cycle construction for unlabeled graphs; the paper notes that the cases k=3k=3 and k=4k=4 are possible, while existence for all k≥3k \geq 3 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.