The following pages link to Emil R. Vaughan (Q456380):
Displayed 17 items.
- Turán \(H\)-densities for 3-graphs (Q456381) (← links)
- (Q1010919) (redirect page) (← links)
- The complexity of constructing gerechte designs (Q1010920) (← links)
- (Q1689949) (redirect page) (← links)
- The codegree threshold of \(K_4^-\) (Q1689950) (← links)
- Bounds on the \(k\)-domination number of a graph (Q2430065) (← links)
- Hall's Condition for Partial Latin Squares (Q2799808) (← links)
- An analogue of Ryser's Theorem for partial Sudoku squares (Q2895331) (← links)
- The Codegree Threshold for 3-Graphs with Independent Neighborhoods (Q2944457) (← links)
- (Q3015661) (← links)
- (Q3090468) (← links)
- Gerechte designs with rectangular regions (Q3165562) (← links)
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs (Q4903261) (← links)
- An Asymptotic Version of the Multigraph 1‐Factorization Conjecture (Q4908822) (← links)
- Graph Guessing Games and Non-Shannon Information Inequalities (Q5358568) (← links)
- Minimum Number of<i>k</i>-Cliques in Graphs with Bounded Independence Number (Q5397739) (← links)
- On applications of Razborov's flag algebra calculus to extremal 3-graph theory (Q6228230) (← links)