The 7/8 circumference-ratio conjecture for cyclically 4-edge-connected cubic graphs
Statement
A cubic graph is a graph in which every vertex has degree , and it is cyclically -edge-connected if at least four edges must be removed to disconnect it into components containing at least two cycles. The circumference ratio of a graph is the length of a longest cycle divided by its number of vertices. The 7/8 circumference-ratio conjecture. Every cyclically -edge-connected cubic graph has circumference ratio at least . This is proposed as a strengthening of Bondy's linear circumference conjecture. The paper constructs cyclically -edge-connected cubic graphs with circumference ratio , showing that the proposed bound would be tight if true.
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.