1 citations · 1 across the 4 of their papers we have counts for
4 papers
A note on directed analogues of the Sidorenko and forcing conjectures
Jacob Fox, Zoe Himwich, Nitya Mani +1
We study analogues of Sidorenko's conjecture and the forcing conjecture in oriented graphs, showing that natural variants of these conjectures in directed graphs are equivalent to…
Extremal results on feedback arc sets in digraphs
Jacob Fox, Zoe Himwich, Nitya Mani
A directed graph is oriented if it can be obtained by orienting the edges of a simple, undirected graph. For an oriented graph , let denote the size of a minimum feedback…
Making an -Free Graph -Colorable
Jacob Fox, Zoe Himwich, Nitya Mani
We study the following question: how few edges can we delete from any -free graph on vertices in order to make the resulting graph -colorable? It turns out that various c…
Roadblocked monotonic paths and the enumeration of coalescent histories for non-matching caterpillar gene trees and species trees
Zoe M. Himwich, Noah A. Rosenberg
Given a gene tree topology and a species tree topology, a coalescent history represents a possible mapping of the list of gene tree coalescences to associated branches of a species…