The one-fifth conjecture for isolated cycles in connected graphs
Statement
Let , and let denote the maximum number of vertex-disjoint members of in a graph . Problem 3 asks for the smallest real number , if it exists, such that there is a finite set of graphs satisfying
for every connected graph that is not an -graph. One-fifth conjecture. The number in this problem is . This conjecture extends the bound for isolating squares in connected graphs to the family of cycles of length at least four, up to excluding a finite set of exceptional graphs; the surrounding text presents it as an open problem.
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.