CURRICULUM VITAE

Name: CECIL CLYDE ROUSSEAU Department:MATHEMATICAL SCIENCES


EDUCATION
DEGREES DISCIPLINE INSTITUTION YEAR
B.S. Electrical Engineering Lamar State College of Technology 1960
M.S. Physics Texas A&M University 1962
Ph.D. Physics Texas A&M University 1968

EXPERIENCE
RANK/POSITION DEPARTMENT/DIVISION INSTITUTION/COMPANY/ORGANIZATION PERIOD
Assistant Professor Physics Baylor University 1968-1970
Assistant Professor Mathematics Memphis State University 1970-1975
Carnegie Fellow Mathematics University of Aberdeen ( Scotland) 1975-1976
Associate Professor Mathematics Memphis State University 1976-1981
Professor Mathematics Memphis State University 1981-1987
Visiting Professor Combinatorics University of Waterloo ( Canada) 1987-1988
Professor Mathematics Memphis State University 1988-

HONORS/AWARDS
HONOR/AWARD INSTITUTION/COMPANY/ORGANIZATION YEAR
Meritorious Faculty Award College of Arts and Sciences, The University of Memphis 1992
Dunavant Professorship The University of Memphis 1998

TEACHING EXPERIENCE
SUBJECT INSTITUTION
SUBJECT (indicate Undergraduate (U), Graduate (G), Other) INSTITUTION
Elementary Mathematics (U), University of Memphis
Discrete Mathematics (U,G), Analysis (U,G), Applied mathematics (U,G)  
Elementary mathematics (U), University of Waterloo
Combinatorics (G)  


STUDENT ADVISING/MENTORING
CURRENT DEGREE NAME YEAR OF GRADUATION
Doctoral Firasath Ali 1994
  Yusheng Li 1996
  Sumeda Jayawardene 1998
  Sam Speed 2005

Books Published

1. Winning Solutions, Springer-Verlag, 1996.

2. USA and International Mathematical Olympiads 2005,  MAA, 2006 (with Zuming Feng and Melanie Matchett Wood)

Refereed Journal Publications

1. Kinetic energy as a perturbation I, J. Math. Anal. Appl. 20 (1967) 103-109 (with J. L. Gammel and D. P. Saylor).

2.        Kinetic energy as a perturbation II, J. Math. Anal. Appl. 20 (1967) 229-238 (with J. L. Gammel, D. P. Saylor and R.M. Wright).

3.        A generalization of the Pad approximant, J. Math. Anal. Appl. 20 (1967) 416-420 (with J. L. Gammel and D. P. Saylor).

4. Applications of perturbation theory to many-body systems with localized particles, J.Mathematical Phys.10 (1969) 2179-2184

5. Calculations of stopping cross sections for 0.8- to 2.0 MeV alpha particles, Phys. Rev. A. 4 (1971) 1066-1070 (with W. K. Chu and D. Powers).

6. Theory of path length distributions I, Discrete Math. 6 (1973) 35-52 (with R. J. Faudree and R. H. Schelp).

7. Generalized Ramsey theory for multiple colors, J. Combinatorial Theory Ser. 20 (1976) 250-264 (with P. Erd"s, R. J. Faudree and R. H. Schelp).

8. On cycle-complete graph Ramsey numbers, J. Graph Theory 2 (1978) 53-64 (with P. Erd"s, R. J. Faudree and R. H. Schelp).

9. On Ramsey numbers for books, J. Graph Theory 2 (1978) 77-87 (with J. Sheehan).

10. Ramsey numbers for books, in Probl mes Combinatoires et Th orie des Graphes, edited by J. C. Bermond et al., CNRS, Paris (1978) 367-369.

11. The size Ramsey number, Period. Math. Hungar. 9 (1978) 145-161 (with P Erd"s, R. J. Faudree and R. H. Schelp).

12. More from the good book, in Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica Publishing Inc., Winnipeg (1978) 289-299 (with R. J. Faudree and J. Sheehan).

13. A class of Ramsey problems involving trees, J. London Math. Soc.} (2) 18 (1978) 392-396 (with J. Sheehan).

14. Ramsey-minimal graphs for multiple copies, Indag. Math. 40 (1978) 187-195 with S. A. Burr, P. Erd"s, R. J. Faudree and R. H. Schelp).

15. Panarboreal graphs, Israel J. Math.135 (1980) 177-185 (with R. J. Faudree, R. H. Schelp and S. Schuster).

16. An extremal problem in generalized Ramsey theory, Ars Combinatoria} {bf 10} (1980) 193-203 (with S. A. Burr, P. Erd"s, R.J. Faudree and R. H. Schelp).

17. All triangle-graph Ramsey numbers for connected graphs of order six, J. Graph Theory 4 (1980) 293-300 (with R. J. Faudree and R. H. Schelp).

18. Ramsey minimal graphs for the pair star - connected graph, Studia Math. Hungar. 50 (1980) 265-273 (with S. A. Burr, P. Erd"s, R. J. Faudree and R. H. Schelp).

19. Graphs which are embeddable in their complements, Czech. Math. J. 31 (1981) 53-62 with R. J. Faudree, R. H. Schelp and S. Schuster).

20.     Ramsey minimal graphs for star forests, Discrete Math. 33 (1981) 227-237 (with S. A. Burr, P. Erd"s, R. J. Faudree and R. H. Schelp)

21.     On star-book Ramsey numbers, in The Theory and Applications of Graphs, G. Chartrand, editor, John Wiley, 1981

22. Ramsey-minimal graphs for matchings, ibid. (with S. A. Burr, P. Erd"s R. J. Faudree and R. H. Schelp).

23. Generalizations of a Ramsey result of Chv tal, ibid.(with R. J. Faudree and R. H. Schelp).

24. Strongly regular graphs and finite Ramsey theory, Linear Algebra and Its Applications 46 (1982) 221-241 (with R. J. Faudree and J. Sheehan).

25. Ramsey numbers for brooms, in Proceedings of the Thirteenth Southeastern Conference on Combinatorics, Graph Theory and Computing} (Boca Raton, FL, 1982). Cong. Numer.} 35 (1982) 283-293 (with P. Erd"s, R. J. Faudree and R. H. Schelp).

26. Graphs with certain families of spanning trees, J. Combin. Theory Ser. B 32 (1982) 162-170 (with P. Erd"s, R. J. Faudree and R. H. Schelp).

27. Ramsey numbers for the pair sparse graph, path or cycle, Trans. A.M.S. 269(2) (1982) 501-511 (with S. A. Burr, P. Erd"s, R. J. Faudree and R. H. Schelp).

28. Ramsey minimal graphs for forests, Discrete Math.38 (1982) 23--32 (with S. A. Burr, P. Erd"s, R. J. Faudree and R. H. Schelp).

29.     On Ramsey numbers involving starlike multipartite graphs, J. Graph Theory 7 (1983) 395-409 (with S. A. Burr, R. J. Faudree and R. H. Schelp).

30.     An extremal problem for paths in bipartite graphs, J. Graph Theory 8 (1984) 83-95 (with A. Gy rf s and R. H. Schelp).

31. Tree - multipartite graph Ramsey numbers, in Graph Theory and Combinatorics - A Volume in Honor of Paul Erd"s, B la Bollob s, editor, Academic Press, 1984 (with P. Erd"s, R. J. Faudree and R. H. Schelp).

32. A class of size Ramsey problems involving stars, ibid. (with R. J. Faudree and J. Sheehan).

33. Generalizations of the tree - complete graph Ramsey number, in Graphs and Applications - Proceedings of the First

34. Complex strict convexity of certain Banach spaces, Monatsh. Math. 99 (1985) 199-211 (with J. E. Jamison and I. Loomis).

35. The Ramsey number for the pair complete bipartite graph - graph of limited degree, in Graph Theory with Applications to Algorithms and Computer Science, Y. Alavi et al., editors, Wiley-Interscience, 1985 (with S. A. Burr, P. Erd"s, R. J. Faudree and R. H. Schelp).

36. Edge disjoint Hamiltonian cycles, ibid. (with R. J. Faudree and R. H. Schelp).

37. Studies related to the Ramsey number r(K5 - e), ibid. (with R. J. Faudree and R. H. Schelp).

38. Multipartite graph - sparse graph Ramsey numbers, Combinatorica 5 (1985) 311-318 (with P. Erd"s, R. J. Faudree and R. H. Schelp).

39. A Ramsey problem of Harary on graphs with prescribed size, Discrete Math. 67 (1987) 227-233 (with P. Erd"s, R. J. Faudree and R. H. Schelp).

40. Goodness of trees for generalized books, Graphs Comb. 3 (1987) 1-6 (with S. A. Burr, P. Erd"s, R. J. Faudree, R. J. Gould, M. S. Jacobson and R. H. Schelp).

41. On the logistic mid-range, Ann. Inst. Statist. Math. 39 (1987) 627-635 (with E. O. George).

42. Extremal theory and bipartite graph - tree Ramsey numbers,Discrete Math. 72 (1988) 103-112 (with P. Erd"s, R. J. Faudree and R. H. Schelp).

43. Small order graph - tree Ramsey numbers, Discrete Math. 72 (1988) 119-127 (with P. Erd"s, R. J. Faudree and R. H. Schelp).

44. Some complete bipartite graph - tree Ramsey numbers, Ann. Discrete Math. 41 (1989) 79-89 (with S. Burr, P. Erd"s, R. J. Faudree and R. H. Schelp).

45. A simply obtained asymptotic expansion for the probability that a random mapping is connected, Applied Mathematics Letters 2, no. 2 (1989) 159-161.

46. Asymptotic expansion of the logistic midrange, Applied Mathematics Letters 2, no. 3 (1989) 1-3 (with E. O. George and I. J. McGee).

47. An extremal problem for complete bipartite graphs, Studia Math. Hungar. 23 (1988), no. 3-4 319-326 (with P. Erd"s, R. J. Faudree and R. H. Schelp).

48. The book-tree Ramsey numbers, Scientia 1 (1988), 111-117 (with P. Erd"s, R. J. Faudree and R. H. Schelp).

49. Multipartite graph - tree Ramsey numbers, Ann. NY Acad. Sci. 576 (1989) 146-154 (with P. Erd"s, R. J. Faudree and R. H. Schelp).

50. Monochromatic coverings in colored complete graphs, Congr. Numer. 71 (1990) 29-38 (with P. Erd"s, R. J. Faudree, R. J. Gould, A. Gy rf s and R. H. Schelp).

51. Subgraphs of minimal degree k, Discrete Math. 85 (1990) 53-58 (with P. Erd"s, R. J. Faudree and R. H. Schelp).

52. Edge conditions for the existence of minimal degree subgraphs, in Proceedings of the Sixth International Conference on

53. Cycle-book Ramsey numbers, Ars Combinatoria 31 (1991) 239-248 (with R. J. Faudree and J. Sheehan).

54. A good idea in Ramsey theory, in Graph Theory, Combinatorics, Algorithms, and Applications, Y. Alavi et al, editors, Proceedings in Applied Mathematics 5.4, SIAM, Philadelphia, PA (1991), chapter 16, 180-189 (with R. J. Faudree and R. H. Schelp).

55. Extremal problems involving vertices and edges on odd cycles, Discrete Math. 101 (1992) 23-31 (with P. Erd"s and R. J. Faudree).

56. Asymptotics of the logistic range, Sankhya, Series B 54, Part 2 (1992) 165-169 (with E. O. George).

57. Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs, European J. Combin. 14 (1993) 183-189. (with P. Erd"s, G. Chen and R. H. Schelp).

58. Asymptotic bounds for irredundant and mixed Ramsey numbers, J. Graph Theory 17 (1993) 193-206 (with G. Chen and J. H. Hattingh).

59. The size Ramsey number of a complete bipartite graph, Discrete Math.113 (1993) 259-262 (with P. Erd"s).

60. Ramsey size linear graphs, Probability and Computing 2 (1993) 389-399 (with P. Erd"s, R. J. Faudree and R. H. Schelp).

61. Extremal problems and generalized degrees, Discrete Math. 127 (1994), 139-152 (with P. Erd"s and R. J. Faudree).

62. A local density condition for triangles, Discrete Math. 127 (1994), 153-161 (with P. Erd"s, R. J. Faudree and R. H. Schelp).

63. On a conjecture concerning graphical partitions, Congr. Numer.104 (1994), 150-160 (with F. Ali).

64. The irredundant Ramsey number s(3,7), J.Graph Theory 19 (1995), 263-270 (with G. Chen).

65. A note on graphical partitions, J. Combin. Theory Ser. B 64 (1995), 314-318 (with F. Ali).

66. Elementary proof of a counting formula for acyclic bipartitetournaments, J. Graph Theory 20 (1995), 319-322.

67. The phi number system revisited, Math. Magazine 68 (1995), pp. 283-284.

68. On book-complete graph Ramsey numbers, J. Combin. Theory Ser.B 68 (1996), 36-44.

69. Some hypergraph questions suggested by a Nordic Olympiad problem, J. Combin. Math. Combin. Comput. 22 (1996), 183-192 (with Z. Tuza).  

70. Fan-complete graph Ramsey numbers, J. Graph Theory 23 (1996), 413-420 (with Y. Li).  

71.     Problems in graph theory from Memphis, in The Mathematics of Paul Erd"s, R. L. Graham and J. Nešetril, editors, Springer-Verlag, Berlin, 1996, pp. 7-26 (with R. J. Faudree and R. H. Schelp).  

72 Rachele Dembowski's partition problem, Pi Mu Epsilon Journal 10 (1996), pp. 364-370.  

73. The Ramsey number for a quadrilateral vs. a complete graph on six vertices, Cong. Numer. 123 (1997), 97-108 (with C. J. Jayawardene).  

74. Ramsey linear families and generalized subdivided graphs, Discrete Math. 170 (1997), pp. 269-275 (with Y. Li and L. Šolt s).  

75.     A Ramsey goodness result for graphs with many pendant edges, Ars Combin. 49 (1998), pp. 315-318 (with Y. Li).  

76.     A note on the Ramsey number Discrete Math.170 (1997), pp. 265-267 (with Y. Li).  

77.     Ramsey linear families and generalized subdivided graphs, Discrete Math. 170 (1997), 269-275 (with Y. Li and L. Šolt s).  

78.     The Ramsey number for a quadrilateral vs. a complete graph on six vertices, Cong. Numer. 123 (1997), pp. 97-108 (with C. Jayawardene).  

79.     An upper bound for the Ramsey number of a quadrilateral vs. a complete graph on seven vertices, Cong. Numer 180 (1998), pp. 175-188 (with C. J. Jayawardene).  

80.     The number of cycle lengths in graphs of given minimum degree and girth, Discrete Math. 200 (1999), pp. 55-60 (with P. Erdõs, R. J. Faudree, and R. H. Schelp).  

80.     Ramsey numbers r(C6,G) for all graphs G of order less than six, Cong. Numer. 136 (1999), pp. 147-159 (with C. J. Jayawardene).

81. Ramsey numbers r(C5,G) for all graphs of order six, Ars Combin. 57 (2000), 163-173 (with C. J. Jayawardene

82. The Ramsaey number for a cycle of length five vs. a complete graph of order six, J. Graph Theory 35 (2000), 99-108 (with C.J. Jayawardene

83. The Ramsey numbers for a quadrilateral vs. all graphs with six vertices, J. Combin. Math Combin. Comput. 35 (2000, 71-87 (with C.J. Jayawardene).

84. On a conjecture involving cycle-complete graph Ramsey numbers, Australas. J. Combin. 22 (2000), 63-72 (with B. Bollobas, C..J. Jayawardene, J. Yang, H. Yi Ru, and Z. Ke Min).

85. Asymptotic upper bounds for Ramsey functions, Graphs Combin. 17 (2001), 123-128 (with Y. Li and W. Zang).

86. Asymptotic bounds for bipartite Ramsey numbers, Electron. J. Combin. 8 (2001), R17 (with Y. Caro).

87. The lower bound on independence number, Sci. China Ser. A 45 (2002), 64-69 (printed in both English and Chinese) (with Y. Li and W. Zang) 88. Blocking sets for paths of a given length, J. Combin. Math. Combin. Comput. 40 (2002), 65 - 78 (with P. Erdős, R. J. Faudree,

E. T. Ordman, and R. H. Schelp).

89. A generatingfunctionology approach to a problem of Wilf, J. Comput. Appl. Math. 142 (2002), 107 - 114 (with P. Hitzcenko and C. D. Savage).

90. Random induced graphs, Discrete Math. 248 (2002), 249 - 254 (with B. Bollob s, P. Erdős, R. J. Faudree, and R. H. Schelp).

91. Zero-sum matrices, Europ. J. Combin. 23 (2002), 761-767 (with P. Balister, Y. Caro, and Y. Yuster).

92. Mixed Ramsey numbers revisited, Probab. Combin, Comput. 12 (2003), 653-665 (with S. Speed).

93. An upper bound for Ramsey numbers, Appl. Math. Lett. 17 (2004), no. 6, 663-665 (with Y. Li)

94. Large generalized books are p-good, J. Combin. Theory Ser. B 92 (2004), pp. 85-97 (with V. Nikiforov)

 95. Book Ramsey numbers I,  Random Struct. Alg. 27 (2005), 379-400 (with V. Nikiforov).  

 96. Book Ramsey numbers and quasi-randomness, Comb. Prob. Comput. 14 (2005), 851-860 (with V. Nikiforov and R. H. Schelp).   

97. A note on Ramsey numbers for books, J. Graph Theory 49 (2005), 168-179 (with V. Nikiforov).  

Presentations - Conference (refereed *)

INVITED PRESENTATIONS

Conferences

1. Clemson Mini-Conference on Combinatorics

2. Problems of Paul Erdos in Ramsey theory: some recent advances, Paul Erdos Conference, Memphis, February 23-24, 2001.

INVITED TALKS

1.        Asymptotic bounds for certain sequences of Ramsey numbers. Eleventh Clemson Mini-Conference on Discrete Mathematics, Oct. 10 - 11, 1996

2.        Special Function Problems in the SIREV Problems and Solutions Section, A Retrospective. SIAM National Meeting, Toronto, July 13 - 17, 1998

3.        Asymptotic and sharp bounds for graphical Ramsey numbers. Special Session on Combinatorial Theory, AMS Meeting, Las Vegas, April 10 - 11, 1999

4.        Problems of Paul Erdős in Ramsey theory: some recent advances. Paul Erdős Conference, Memphis, February 23 - 24, 2001

5.        Asymptotic bounds for Ramsey numbers. Minisymposium on Ramsey Theory, SIAM Conference on Discrete Mathematics, San Diego, August 11 - 14, 2002

6.        Recent results on H-good sequences of graphs, Paul Erdos Conference, Memphis, February 25-26, 2005


SERVICE
UNIVERSITY COMMITTEE/ACTIVITY PERIOD
  Tenure and Promotion, Chair Self-Study Committee 2001
  Chair Search Committee  
  Departmental Newsletter (co-editor)  
  Interim Chair 1990-1991 Academic Year
  Recruiting Committee, Chair 2004-2005
  Self-Study Committee, Chair  
  T & P Committee, Chair  
  T & P Guidelines Revision, Chair  
  Undergraduate Committee, Chair  
  College T&P Committee  
  Graduate Studies and Research  
  Honors Advisory Panel  
  Ethics Committee  
  Faculty Roles and Rewards Committee on Planning  
  Tenure and Promotion Appeals, Chair  
  Executive Board, Phi Kappa Phi  
  A&S Graduate Council 2006-2007
  Ad Hoc Committee on Library Allocations 2006-2007

OTHER
SOCIETY/ORGANIZATION/JOURNAL COMMITTEE/EDITORIAL BOARD/OFFICE PERIOD
  USAMO Committee [C] 1991-1998, 2005-
  Editor, Problems and Solutions 1973-1998
  Collaborating Editor, Problems and Solutions 1999-
  Chair, Problems Committee and Chief Coordinator 2001
  University of Memphis Putnam Team 2000-
  Problems and Solutions, (Electronic Publication of SIAM) 1999
  Journal of Graph Theory 1984-1985 Academic Year

Appendix A

Academic Year (please indicate year) Course # Course Name Credit Hours Percent Taught Enroll Labratory Supervised(S)/Instructed(I) New Preparation (Y) /(N)
Fall 1996 1401 Honors Calculus, I 3 100 11   N
  3221 Number Theory 3 100 9   N
  8821 Special Functions and Combinatorics 3 100 5    
Spring 1997 1402 Honors Calculus, II 3 100 3   N
  3581 Geometry 3 100 13   N
Fall 1997 Fall 3242 Linear Algebra 3 100 6   N
  4411 Topology 3 100 1   Y
  7/8821 Analytic Number Theory 3 100 2   Y
Spring 1998 2322 Calculus III 4 100 7   N
  3581 Geometry 3 100 5   N
  7/8821 Asymptotic Methods in combinatorics 3 100 2   Y
Fall 1998 2312 Calculus II 4 100 9   N
  2701 Discrete Structures 3 100 8   N
  7361 Complex Analysis 3 100 3   Y
  7/8821 Special Functions and Combinatorics 3 100 2   Y
Spring 1999 3581 Geometry 3 100 8   N
Fall 1999 1401 Honors Calculus I 4 100 2    
  2000 Experiences in Mathematics 3 100 3    
  7027 Special Functions 3 100 5   Y
Spring 2000 3581 College 3 100 8    
  7023 q-Series and q-Analogs in Combin. 3 100 2   Y
Fall 2000   PDA          
Spring 2001 3581 College 3 100 10    
  4\6231 Abstract Algebra 3 100 11   Y
Fall 2001 2000 Experiences in Mathematics 3 100 15    
  7361 Complex Analysis 3 100 2    
Spring 2002 1910 Calculus I 4 100 47    
  4-6361 Complex Variables 3 100 8    
Fall 2002 1910 Calculus I 4 100      
  3221 Number Theory 3 100      
Spring 2003 2702 Introduction to Proofs 3 100 11    
  4-6361 Complex Variables 3 100 10    
Fall 2003 2000 Experiences in Mathematics 3 100 28    
  7375 Mathematical Physics 3 100 4    
    Analytic Number Theory 3 100 4    
Fall 2004 1920 Calculus II          
  7375 Mathematical Physics          
Spring 2005 1720 Trigonometry 3 100 26    
  4-6242 Linear Algebra 3 100 8    

Appendix B

Additional Information on Advising/Mentoring
 

Appendix C

Additional Information on Research/Scholarship/Creative Activities
 

Appendix D

Additional Information on Support
 

Appendix E

Additional Information on Outreach
 
Appendix A
 
Teaching Activity Name of Candidate: Cecil Rousseau
 
PRIVATE Academic Year (please indicate year)
 
Course #
 
Course Name
 
Credit Hours
 
Laboratory
 
Supervised (S)
 
Instructed (I)
 
Preparation
 
Fall 1996
 
Honors Calculus, I
 
Number Theory
 
Special Functions and Combinatorics
 
Spring 1997
 
Honors Calculus, II
 
Fall 1997
 
Linear Algebra
 
Analytic Number Theory
 
Spring 1998
 
Calculus III
 
Asymptotic Methods in combinatorics
 
Fall 1998
 
Calculus II
 
Discrete Structures
 
Complex Analysis
 
Special Functions and Combinatorics
 
Spring 1999
 
Fall 1999
 
Honors Calculus I
 
100
 
Experiences in Mathematics
 
Special Functions
 
Spring 2000
 
3581
 
College Geometry
 
100
 
q-Series and q-Analogs in Combin.
 
3
 
100
 
Spring 2001
 
3581
 
College Geometry
 
100
 
Abstract Algebra
 
3
 
100
 
Fall 2001
 
Experiences in Mathematics
 
Complex Analysis
 
3
 
Spring 2002
 
Calculus I
 
Complex Variables
 
Fall 2002
 
Calculus I
 
Number Theory
 
Spring 2003
 
Introduction to Proofs
 
Complex Variables
 
Fall 2003
 
Experiences in Mathematics
 
Mathematical Physics
 
Analytic Number Theory
 
Fall 2004
 
Calculus II
 
Mathematical Physics
 
Spring 2005
 
Trigonometry
 
Linear Algebra
 
PLEASE ATTACH A SUMMATION OF STUDENT EVALUATIONS FOR EACH COURSE ASSESSED.
 
APPENDIX C
 
Papers Submitted and to appear
 
Path convex Ramsey numbers (with C. J. Jayawardene and H. Harborth).
 
Asympototic bounds for Ramsey numbers.
 
Book Ramsey numbers I (with V. Nikiforov)