Speaker
John Byrne
(University of Delaware)
Description
Let $F$ be a digraph. What is the largest possible minimum outdegree on an $n$-vertex digraph which does not contain a copy of $F$? I will discuss algebraic approaches to this question and present some of my related work (joint with Michael Tait).
Authors
John Byrne
(University of Delaware)
Michael Tait
(Villanova University)