ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph. Its density is

d(G)=∣E(G)∣∣V(G)∣−1.d(G)=\frac{|E(G)|}{|V(G)|-1}.

The graph GG is uniformly dense if d(H)≤d(G)d(H)\leq d(G) for every connected subgraph HH of GG. A graph is cyclically orderable if it has a cyclic ordering of its edges such that every cyclically consecutive ∣V(G)∣−1|V(G)|-1 edges induce a spanning tree. Kajitani, Ueno and Miyano's conjecture. A connected graph GG 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.