activity
20112026
most citedReducing Degeneracy in Maximum Entropy Models of Networks

35 citations · 95 across the 25 of their papers we have counts for

collaborators

33 papers

math.CO2026

On Agreement Subtrees in Multiple Phylogenetic Trees

Bryan Currie, Éva Czabarka, Mareike Fischer +3

Snir and Yuster [Discrete Appl. Math. 347 (2026) 160--171] asked for the least number such that unrooted binary phylogenetic trees on the same leaves always share…

math.CO2026

Curious crossing-critical edges

Éva Czabarka, Alec Helm

Motivated by Kuratowski's theorem, a Kuratowski subgraph of a graph is a subgraph that is a subdivided or a subdivided . An edge is crossing-critical if the crossing…

math.CO2025

Coconvex characters on collections of phylogenetic trees

Eva Czabarka, Steven Kelk, Vincent Moulton +1

In phylogenetics, a key problem is to construct evolutionary trees from collections of characters where, for a set X of species, a character is simply a function from X onto a set…

math.CO2025

Reconstruction of caterpillar tanglegrams

Ann Clifton, Eva Czabarka, Kevin Liu +4

A tanglegram consists of two rooted binary trees with the same number of leaves and a perfect matching between the leaves of the trees. Given a size- tanglegram, i.e., a tangleg…

math.CO2023

Decks of rooted binary trees

Ann Clifton, Eva Czabarka, Audace Dossou-Olory +5

We consider extremal problems related to decks and multidecks of rooted binary trees (a.k.a. rooted phylogenetic tree shapes). Here, the deck (resp. multideck) of a tree refers…

math.CO2023

Universal rooted phylogenetic tree shapes and universal tanglegrams

Ann Clifton, Eva Czabarka, Kevin Liu +4

We provide an lower bound and an upper bound for the smallest size of rooted binary trees (a.k.a. phylogenetic tree shapes), which are universal for rooted b…