Kunal Dutta
(The Institute of Mathematical Sciences, 2014)
This thesis studies four problems on graphs using the Probabilistic Method. The first two
are finding the maximum size of an induced acyclic tournament and acyclic subgraph respectively, in random directed graphs. The ...