Component structure and vertex cardinalities of the digraph cal D^*_m
Statement
Let . The digraph has components and , where consists of components ordered by nonincreasing vertex cardinality. Component-structure conjecture. The digraph has exactly components, all are bipartite, and
for , while
Moreover, and belong to the same component; if , then is in the same class if and only if is odd. These properties were inferred from computational data and were stated for future study; no proof or resolution is supplied here.
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.