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