Given a graph F and integers r,n, how many and what kinds of cycles longer than n can occur in a graph H with H\to(F)^r and with every induced cycle of length at most n…
Statement
Given a graph F and integers r,n, how many and what kinds of cycles longer than n can occur in a graph H with H\to(F)^r and with every induced cycle of length at most n inherited from a copy of F?
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.