The cubic solid-brick odd-intercyclic conjecture
Statement
A solid brick is a brick with no nontrivial separating cut, and a graph is odd-intercyclic if every two odd cycles have a common vertex. A graph is cubic if every vertex has degree three. Cubic solid-brick conjecture. Every cubic solid brick is odd-intercyclic. This would narrow the structure of cubic solid bricks and support the search for efficient recognition algorithms; the source reports that no cubic solid brick violating odd-intercyclicity was known.
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.