Michael E. Picollelli


 
Welcome to my page!   (This page is also redirected from http://goo.gl/KUu8z - shorter to type but harder to remember!)

I'm currently a Post Doctoral Researcher in the Department of Electrical and Computer Engineering at the University of Delaware, working with Charlie Boncelet.  
Previously, I taught briefly in the
Department of Mathematical Sciences here at UD, and before that in the Mathematics Department at Lafayette College.

I received my Ph.D. in Algorithms, Combinatorics and Optimization in 2008, under the advisement of Tom Bohman at Carnegie Mellon University.

My research focus is on extremal and probabilistic combinatorics, particularly problems in extremal graph theory and random graph theory.

Academic Information

Curriculum Vitae: PDF Format
Publication List: PDF Format - This document is hyperlinked and includes articles in preparation
Statement of Research Interests: PDF Format
Statement of Personal Teaching Philosophy: PDF Format - This includes a summary of courses I have taught.

Research Papers 
(Title links to preprint if available.)

"The final size of the C_{\ell}-free process", submitted.

"A note on K_r-free graphs with chromatic number at least r", submitted.


"SIR epidemics on random graphs with a fixed degree sequence", with Tom Bohman, Random Structures & Algorithms,  to appear.

"The final size of the C_4-free process", Combinatorics, Probability and Computing 20 (2011), 939-955.  Journal Version.
 
"Set systems without a 3-simplex", Discrete Mathematics 311 (2011), 2113-2116. Journal Version.

"An Anti-Ramsey Condition on Trees," Electronic Journal of Combinatorics, 15(1) (2008), R24.

Doctoral Thesis: "Extremal Problems and Random Processes on Graphs."

Past Teaching Links

PGSS 2007 Discrete Math Core Course Homepage
SAMS 2007 Pre-Calculus Course Homepage (Carnegie Mellon)