The maximal Euler characteristic conjecture for multipath complexes
Statement
Let be the complete digraph on vertices, with a bidirectional edge between every pair of vertices. Let be any digraph on vertices, and write for the multipath complex and for reduced Euler characteristic.
Maximal Euler characteristic conjecture.
The conjecture asserts that the complete digraph has the largest reduced Euler characteristic among multipath complexes of digraphs on vertices. It was verified computationally for in the source, while the general case remains open.
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.