Buhl cycle-condition converse for the weak maximum likelihood threshold

From papers

Let GG be a graph with at least one edge. An orientation of GG is acyclic if it has no directed cycles, and a cycle is stretched when it has the form v1v2vkv1v_1\to v_2\to\dots\to v_k\leftarrow v_1. Let wmlt(G)\operatorname{wmlt}(G) denote the weak maximum likelihood threshold. Buhl cycle-condition converse. If GG has an acyclic orientation with no stretched cycles, then

wmlt(G)=2.\operatorname{wmlt}(G)=2.

The forward implication is known: weak maximum likelihood threshold 22 implies the existence of such an orientation. The conjecture asserts the converse, completing the rigidity-theoretic characterization of graphs with weak maximum likelihood threshold 22.

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

Daniel Irving Bernstein, Sean Dewar, Steven J. Gortler, Anthony Nixon, Meera Sitharam and Louis Theran, “Maximum likelihood thresholds via graph rigidity”, arXiv:2108.02185 (2023).

Solutions 0

No solutions have been posted yet.