Generalized graph realization conjecture for heteroclinic networks
Statement
Let be a directed graph. Theorem~ gives a realization result for graphs without -cycles or -cliques.
Generalized realization conjecture. The conclusion of Theorem~ holds even for directed graphs that may contain -cycles and -cliques.
The conjecture proposes that the restrictions excluding -cycles and -cliques are unnecessary, extending the construction to the more general class of directed graphs. Other realization methods already give robust realizations under the weaker assumption that has no -cycles, but this stronger extension is not established 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.