Qazaqzeh–Qublan–Jaradat crossing-number conjecture for quasi-alternating links

Let LL be a quasi-alternating link, and let c(L)c(L) denote its crossing number and det(L)\det(L) its determinant. Qazaqzeh–Qublan–Jaradat conjecture. Every quasi-alternating link LL satisfies

c(L)det(L).c(L) \leq \det(L).

The paper verifies this inequality for quasi-alternating links arising as dealternator extensions of almost alternating diagrams representing quasi-alternating links, but the general conjecture remains open in the supplied context.

Sources & referencesView supporting material

Primary source

Hamid Abchir and Mohammed Sabak, “Generating links that are both quasi-alternating and almost alternating”, arXiv:2003.13725 (2020).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.