Clifford Smyth, Assistant Professor

Office: Petty 105
Email address: cdsmyth@uncg.edu
Personal web page: www.uncg.edu/~cdsmyth/
Starting year at UNCG: 2008
Education
Ph.D. in Mathematics, Rutgers University (2001)
Teaching
Office hours: TR 10:00-10:50Fall, 2013
- MAT 120-03 WTX (Calculus for Business and the Social Sciences)
- MAT 120-03D WTX (Calculus for Business and the Social Sciences)
- MAT 253-01 LEC (Discrete Mathematical Structures), TR 9:30-10:45, Petty Building 224
- MAT 292-02 LEC (Calculus II), TR 3:30-4:45, Sullivan Science Building 103
- MAT 516-01 LEC (Intermediate Abstract Algebra), TR 11:00-12:15, Sullivan Science Building 349
Research Interests
Combinatorics, Mathematical Biology
Recent Publications
- Kahn, Jeff ; Saks, Michael ; Smyth, Clifford . The dual BKR inequality and Rudich's conjecture. Combin. Probab. Comput. 20 (2011), no. 2, 257--266.
- Kemp, Todd ; Mahlburg, Karl ; Rattan, Amarpreet ; Smyth, Clifford . Enumeration of non-crossing pairings on bit strings. J. Combin. Theory Ser. A 118 (2011), no. 1, 129--151.
- Bohman, Tom ; Frieze, Alan ; Pikhurko, Oleg ; Smyth, Cliff . Anti-Ramsey properties of random graphs. J. Combin. Theory Ser. B 100 (2010), no. 3, 299--312.
- Balogh, József ; Smyth, Clifford . On the variance of Shannon products of graphs. Discrete Appl. Math. 156 (2008), no. 1, 110--118.
- Abraham, Uri ; Cummings, James ; Smyth, Clifford . Some results in polychromatic Ramsey theory. J. Symbolic Logic 72 (2007), no. 3, 865--896.
Brief Bio
Dr. Smyth earned a Ph.D. in 2001 from Rutgers University, and he joined the UNCG faculty in 2008. His research lies in combinatorial probability, computational complexity, and discrete geometry.