EVEmil R. Vaughan
Emil R. Vaughan
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Emil R. Vaughan has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Victor Falgas-Ravry
Umeå Universitet
2 shared publications - Jan Volec
Department of Mathematics Faculty of Nuclear Sciences and Physical Engineering Czech Technical University in Prague Trojanova 13 120 00 Prague Czech Republic
1 shared publication - Oleg Pikhurko
Mathematics Institute and DIMAP, University of Warwick, Coventry, UK
1 shared publication
Latest Publications
- Open AccessThe codegree threshold of $K_4^-$The codegree threshold $\mathrm{ex}_2(n, F)$ of a $3$-graph $F$ is the minimum $d=d(n)$ such that every $3$-graph on $n$ vertices in which every pair of vertices is contained in at least $d+1$ edges contains a copy of $F$ as a subgraph. We study $\mathrm{ex}_2(n, F)$ when $F=K_4^-$, the $3$-graph on $4$ vertices with $3$ edges. Using flag algebra techniques, we prove that if $n$ is sufficiently large then $\mathrm{ex}_2(n, K_4^-)\leq (n+1)/4$. This settles in the affirmative a conjecture of Nagle from 1999. In addition, we obtain a stability result: for every near-extremal configuration $G$, there is a quasirandom tournament $T$ on the same vertex set such that $G$ is close in the edit distance to the $3$-graph $C(T)$ whose edges are the cyclically oriented triangles from $T$. For infinitely many values of $n$, we are further able to determine $\mathrm{ex}_2(n, K_4^-)$ exactly and to show that tournament-based constructions $C(T)$ are extremal for those values of $n$.Open AccessThe codegree threshold of $K_4^-$The codegree threshold $\mathrm{ex}_2(n, F)$ of a $3$-graph $F$ is the minimum $d=d(n)$ such that every $3$-graph on $n$ vertices in which every pair of vertices is contained in at least $d+1$ edges contains a copy of $F$ as a subgraph. We study $\mathrm{ex}_2(n, F)$ when $F=K_4^-$, the $3$-graph on $4$ vertices with $3$ edges. Using flag algebra techniques, we prove that if $n$ is sufficiently large then $\mathrm{ex}_2(n, K_4^-)\leq (n+1)/4$. This settles in the affirmative a conjecture of Nagle from 1999. In addition, we obtain a stability result: for every near-extremal configuration $G$, there is a quasirandom tournament $T$ on the same vertex set such that $G$ is close in the edit distance to the $3$-graph $C(T)$ whose edges are the cyclically oriented triangles from $T$. For infinitely many values of $n$, we are further able to determine $\mathrm{ex}_2(n, K_4^-)$ exactly and to show that tournament-based constructions $C(T)$ are extremal for those values of $n$.
- 7 December 2012
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 22 (1) , 21-54
Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
In this paper, we prove several new Turán density results for 3-graphs with independent neighbourhoods. We show: \begin{align*} \pi (K_4^-, C_5, F_{3,2})=12/49, \pi (K_4^-, F_{3,2})=5/18 \textrm {and} \pi (J_4, F_{3,2})=\pi (J_5, F_{3,2})=3/8, \end{align*} whereJtis the 3-graph consisting of a single vertexxtogether with a disjoint setAof sizetand all $\binom{|A|}{2}$ 3-edges containingx. We also prove two Turán density results where we forbid certain induced subgraphs: \begin{align*} \pi (F_{3,2}, \textrm { induced }K_4^-)=3/8 \textrm {and} \pi (K_5, 5\textrm {-set spanning exactly 8 edges})=3/4. \end{align*} The latter result is an analogue forK5of Razborov's result that \begin{align*} \pi (K_4, 4\textrm {-set spanning exactly 1 edge})=5/9. \end{align*} We give several new constructions, conjectures and bounds for Turán densities of 3-graphs which should be of interest to researchers in the area. Our main tool is ‘Flagmatic’, an implementation of Razborov's semi-definite method, which we are making publicly available. In a bid to make the power of Razborov's method more widely accessible, we have tried to make Flagmatic as user-friendly as possible, hoping to remove thereby the major hurdle that needs to be cleared before using the semi-definite method. Finally, we spend some time reflecting on the limitations of our approach, and in particular on which problems we may be unable to solve. Our discussion of the ‘complexity barrier’ for the semi-definite method may be of general interest.- 7 December 2012
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 22 (1) , 21-54
Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
In this paper, we prove several new Turán density results for 3-graphs with independent neighbourhoods. We show: \begin{align*} \pi (K_4^-, C_5, F_{3,2})=12/49, \pi (K_4^-, F_{3,2})=5/18 \textrm {and} \pi (J_4, F_{3,2})=\pi (J_5, F_{3,2})=3/8, \end{align*} whereJtis the 3-graph consisting of a single vertexxtogether with a disjoint setAof sizetand all $\binom{|A|}{2}$ 3-edges containingx. We also prove two Turán density results where we forbid certain induced subgraphs: \begin{align*} \pi (F_{3,2}, \textrm { induced }K_4^-)=3/8 \textrm {and} \pi (K_5, 5\textrm {-set spanning exactly 8 edges})=3/4. \end{align*} The latter result is an analogue forK5of Razborov's result that \begin{align*} \pi (K_4, 4\textrm {-set spanning exactly 1 edge})=5/9. \end{align*} We give several new constructions, conjectures and bounds for Turán densities of 3-graphs which should be of interest to researchers in the area. Our main tool is ‘Flagmatic’, an implementation of Razborov's semi-definite method, which we are making publicly available. In a bid to make the power of Razborov's method more widely accessible, we have tried to make Flagmatic as user-friendly as possible, hoping to remove thereby the major hurdle that needs to be cleared before using the semi-definite method. Finally, we spend some time reflecting on the limitations of our approach, and in particular on which problems we may be unable to solve. Our discussion of the ‘complexity barrier’ for the semi-definite method may be of general interest.