The Complexity of Constructing Gerechte Designs. - Emil R. Vaughan (Electron. J. Comb., 2009)

Daisy chains with four generators. - Donald A. Preece; Emil R. Vaughan (Australas. J Comb., 2011)

Bounds on the k-domination number of a graph. - Ermelinda DeLaViña; Wayne Goddard; Michael A. Henning; Ryan Pepper; Emil R. Vaughan (Appl. Math. Lett., 2011)

Turán H-Densities for 3-Graphs. - Victor Falgas-Ravry; Emil R. Vaughan (Electron. J. Comb., 2012)

Multiple unicasts, graph guessing games, and non-Shannon inequalities. - Rahil Baber; Demetres Christofides; Ntah Ahn Dang; Søren Riis; Emil R. Vaughan (NetCod, 2013)

Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs. - Victor Falgas-Ravry; Emil R. Vaughan (Comb. Probab. Comput., 2013)

Minimum Number of k-Cliques in Graphs with Bounded Independence Number. - Oleg Pikhurko; Emil R. Vaughan (Comb. Probab. Comput., 2013)

An Asymptotic Version of the Multigraph 1-Factorization Conjecture. - Emil R. Vaughan (J. Graph Theory, 2013)

The Codegree Threshold for 3-Graphs with Independent Neighborhoods. - Victor Falgas-Ravry; Edward Marchant; Oleg Pikhurko; Emil R. Vaughan (SIAM J. Discret. Math., 2015)

The codegree threshold of K4-. - Victor Falgas-Ravry; Oleg Pikhurko; Emil R. Vaughan; Jan Volec (Electron. Notes Discret. Math., 2017)

Graph Guessing Games and Non-Shannon Information Inequalities. - Rahil Baber; Demetres Christofides; Ntah Ahn Dang; Emil R. Vaughan; Søren Riis (IEEE Trans. Inf. Theory, 2017)