Emil R. Vaughan

According to our database, Emil R. Vaughan authored at least 11 papers between 2009 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

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

The codegree threshold of K₄^-.

Victor Falgas-Ravry, Oleg Pikhurko, Emil R. Vaughan, Jan Volec

Electron. Notes Discret. Math., 2017

2015

The Codegree Threshold for 3-Graphs with Independent Neighborhoods.

Victor Falgas-Ravry, Edward Marchant, Oleg Pikhurko, Emil R. Vaughan

SIAM J. Discret. Math., 2015

2013

An Asymptotic Version of the Multigraph 1-Factorization Conjecture.

Emil R. Vaughan

J. Graph Theory, 2013

Minimum Number of <i>k</i>-Cliques in Graphs with Bounded Independence Number.

Oleg Pikhurko, Emil R. Vaughan

Comb. Probab. Comput., 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

Multiple unicasts, graph guessing games, and non-Shannon inequalities.

Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Søren Riis, Emil R. Vaughan

Proceedings of the International Symposium on Network Coding, 2013

2012

Turán H-Densities for 3-Graphs.

Victor Falgas-Ravry, Emil R. Vaughan

Electron. J. Comb., 2012

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

Daisy chains with four generators.

Donald A. Preece, Emil R. Vaughan

Australas. J Comb., 2011

2009

The Complexity of Constructing Gerechte Designs.

Emil R. Vaughan

Electron. J. Comb., 2009