Erdős Problem #84 — The cycle set of a graph G on n vertices is a set A⊆ 3,…,n such that there is a cycle in G of length ℓ if and only if ℓ ∈ A.
Statement
The cycle set of a graph on vertices is a set such that there is a cycle in of length if and only if . Let count the number of possible such . Prove that . Prove that .
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.