Nancy Eaton
EDUCATION:
RESEARCH AREA:
Combinatorics with an emphasis in Graph Theory.
Ph.D. Dissertation: Some
Results in Graph Ramsey Theory and Graph Representations.
Advisor: Vojtech Rodl
ACADEMIC POSITIONS HELD:
Professor,
Associate Professor,
Assistant
Professor,
OTHER POSITIONS HELD:
Systems Analyst,
COURSES TAUGHT AT URI:
MTH 107 Introduction to Finite Mathematics
MTH 108 Topic in Mathematics
MTH 131 Applied Calculus I
MTH 132 Applied Calculus II
MTH 141 Introductory Calculus with Analytic Geometry
MTH 142 Intermediate Calculus with Analytic Geometry
MTH 215 Introduction to Linear Algebra
MTH 243 Calculus for Functions of Several Variables
MTH 307 Introduction to Mathematical Rigor
CSC 340 Applied Combinatorics
MTH 382 Number Theory
MTH 447 Discrete Mathematical Structures
MTH 451 Introduction to Probability and Statistics
MTH 513 Linear Algebra
MTH 548 Combinatorics and Graph Theory
MTH 592 Topics Course in Graph Theory
MTH 692 Topics Course in Graph Theory
Ph.D. MAJOR ADVISOR:
Title of dissertation: On the
Erdos-Sos conjecture
Glenn Faubert. Received Ph.D. in 5/05.
Title of
dissertation:
Caterpillar Tolerance Representations of Graphs
Mary
Ann Saadi.
Received Ph.D. in 12/01
Title of dissertation: Some
results on tree-tolerance representations
Thomas
Hull. Received
Ph.D. in 5/97
Title of dissertation: Some
problems in list coloring bipartite graphs.
REFEREED PUBLICATIONS:
[1] With V. Rodl, A canonical Ramsey theorem, Random Structures and Algorithms, 3 (4), 427-444 (1992).
[2] With V. Rodl, Graphs of small dimensions, Combinatorica, 16 (1), 59-85 (1996).
[3] With R. Gould and V. Rodl, On p-intersection representations, Journal of Graph Theory, 21 (4), 377-392 (1996).
[4] With D. Grable, Set representations for almost all graphs, Journal of Graph Theory, 23 (3), 1-12 (1996).
[5] Intersection representations of complete unbalanced bipartite graphs, Journal of Combinatorial Theory Series B, 71 (2), 123-129 (1997).
[6] Ramsey numbers for sparse graphs, Discrete Mathematics, 185, 63-75 (1998).
[7] With T. Hull, Defective list colorings of planar graphs, Bulletin
of the Institute of Combinatorics and its Applications, 24 (Jan.
1999).
[8] A near packing of two graphs, Journal of Combinatorial
Theory, Series B, 80, 98-103 (2000).
[9] With Andrzej Czygrinow, Glenn Hurlbert, and Mark Kayll, On
pebbling threshold functions for graph sequences, Discrete Mathematics, 247
(1-3), 93-105 (2002).
[10] With Z Furedi, A Kostochka, and J Skokan, Tree Representations of Kn,n, European Journal of Combinatorics. 28 (4), 1087-1098 (2007).
[11] With Glenn Faubert, Caterpillar Tolerance Representations
of Cycles, Bulletin of the
ACCEPTED FOR PUBLICATION:
[12] With Gary Tiner, On the Erdös-Sós Conjecture
and graphs with large minimum degree, Ars Combinatoria,(2007).
SUBMITTED:
[13] With Mary Ann Barbato, K1,3-subdivison
Tolerance Representations of Cycles, Discrete Mathematics. Preprint.
[14] With Glenn Faubert, Caterpillar Tolerance Representations, Discrete
Math. Preprint.
[15] With Gary Tiner, On the Erdös-Sós Conjecture and maximum paths, Submitted for publication,(2007).
NOTES:
With W.Kook and L. Thoma,
Monotonicity for Complete Graphs, Manuscript. pdf
TECHNICAL REPORTS:
With V. Rodl, A regularity lemma, Emory University Technical Report Series, (1992).
With R. Gould and V. Rodl, On p-intersection representations, Emory University Technical Report Series, (1992).