The inversion number of the tournament QnQ_n

From papers

Let QnQ_n be the tournament obtained from the transitive tournament of order nn by reversing the arcs of its unique directed Hamiltonian path.

The QnQ_n inversion-number conjecture.

inv(Qn)=n12.\operatorname{inv}(Q_n)=\left\lfloor\frac{n-1}{2}\right\rfloor.

The source introduces this as the explicit-tournament motivation for Belkhechine et al.'s lower-bound conjecture. The source does not state a resolution.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Klingelhoefer, Nicolas Nisse, Clément Rambaud and Quentin Vermande, “Problems, proofs, and disproofs on the inversion number”, arXiv:2212.09188 (2022).

Solutions 0

No solutions have been posted yet.