Nathan W LemonsCNLS Posdoctoral Research Associate
CNLS/T-5 Applied Mathematics 
Office: TA-3, Bldg 1690, Room 125
Mail Stop: B258
Phone: (505) 665-9433
Fax: (505) 665-2659 nlemons@lanl.gov
home page |  | Educational Background/Employment:- B.A. (2004) Mathematics, Oberlin College
- Ph.D.(2008) Mathematics and its Applications, Central European University
Research Interests: - All things finite
- Graph algorithms
- Combinatorics of networks
- Extremal combinatorics
Selected Recent Publications: - P.L. Erdős, E. Gerbner, N. Lemons, D. Mubayi, C. Palmer and B. Pátkos, Two-Part Set Systems. Electronic Journal of Combinatorics 19, (2012) P52
- E. Győri and N. Lemons, Hypergraphs with No Cycle of a Given Length. Combinatorics, Probability and Computing doi:10.1017/S0963548311000691
- E. Győri and N. Lemons, 3-Uniform hypergraphs avoiding a given odd cycle. Combinatorica accepted
- N. Lemons, B. Hu and W. Hlavacek, Hierarchical graphs for rule-based modeling of biochemical systems. BMC Bioinformatics 12 (2011) 1471-2105
- D. Gerbner, B. Keszegh, N. Lemons, C. Palmer, B. Patkós and D. Pálvölgyi, Polychromatic colorings of arbitrary rectangular partitions. Discrete Mathematics 310 (2010) 21-30
|
