3 citations · 5 across the 11 of their papers we have counts for
4 papers · 1 filter
Variations on Sidorenko's conjecture in tournaments
Jacob Fox, Zoe Himwich, Nitya Mani +1
We study variants of Sidorenko's conjecture in tournaments, where new phenomena arise that do not have clear analogues in the setting of undirected graphs. We first consider orient…
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…