ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Kn{\tt K}_n be the complete digraph on nn vertices, with a bidirectional edge between every pair of vertices. Let G{\tt G} be any digraph on nn vertices, and write X(−)X(-) for the multipath complex and χ~\widetilde{\chi} for reduced Euler characteristic.

Maximal Euler characteristic conjecture.

χ~(X(Kn))≥χ~(X(G)).\widetilde{\chi}(X({\tt K}_n))\geq \widetilde{\chi}(X({\tt G})).

The conjecture asserts that the complete digraph has the largest reduced Euler characteristic among multipath complexes of digraphs on nn vertices. It was verified computationally for n<8n<8 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 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.