Kajitani, Ueno and Miyano's conjecture on cyclically orderable graphs
Statement
Let be a connected graph. Its density is
The graph is uniformly dense if for every connected subgraph of . A graph is cyclically orderable if it has a cyclic ordering of its edges such that every cyclically consecutive edges induce a spanning tree. Kajitani, Ueno and Miyano's conjecture. A connected graph is cyclically orderable if and only if it is uniformly dense. This gives a density-theoretic characterization of cyclic base orderings; the source states that the necessity was proved by Kajitani, Ueno and Miyano, while the converse is the conjectural direction.
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.