Yangjing Long

collaborators

4 papers

math.CO2026

Proximity Measures for Classes of Phylogenetic Networks

Leo van Iersel, Mark Jones, Esther Julien +2

Phylogenetic networks are used to represent the evolutionary history of species. Due to biological interpretations and computational advantages, researchers have focused on restric…

math.CO2026

Constrained homomorphism orders

Jiri Fiala, Jan Hubicka, Yangjing Long

We study partial orders induced by constrained variants of finite graph homomorphisms: monomorphisms, embeddings, full homomorphisms, vertex-surjective, edge-surjective and surject…

math.CO2026

The Quantum Homomorphism Orders are Universal

Yangjing Long

Quantum graph homomorphisms, introduced by Mančinska and Roberson, form a natural quantum relaxation of classical graph homomorphisms. Since this relaxation may create new comparab…

math.CO2026

An Explicit $O (r lo g r)$ Threshold for Attaining the Semple--Steel Bound with $r$ -State Characters

Peng Li, Yangjing Long

Let $d_{r} (n)$ be the maximum, over all binary phylogenetic trees with $n$ leaves, of the minimum number of $r$ -state characters required to define the tree. Semple and Steel proved…

Proximity Measures for Classes of Phylogenetic Networks

Constrained homomorphism orders

The Quantum Homomorphism Orders are Universal

An Explicit O(rlogr) Threshold for Attaining the Semple--Steel Bound with r-State Characters

An Explicit $O (r lo g r)$ Threshold for Attaining the Semple--Steel Bound with $r$ -State Characters