Cecil C. Rousseau
Research Subjects
Research Interests
Cecil C. Rousseau has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Vladimir Nikiforov
Univ Memphis, Dept Math Sci, Memphis, TN 38152 USA
4 shared publications - Carla D. Savage
N. C. State University
1 shared publication - Chula J. Jayawardene
Department of Mathematics University of Colombo Sri Lanka
1 shared publication - Heiko Harborth
Diskrete Mathematik, Technische Universität Braunschweig, 38023 Braunschweig, Germany
1 shared publication - Pawel Hitczenko
MCS Department Drexel University Philadelphia 19104 Pa
1 shared publication - Richard H. Schelp
Department of Mathematical Sciences University of Memphis 38152 Memphis TN
1 shared publication
Latest Publications
- 21 March 2017
- Published by Wiley in Journal of Graph Theory
- Vol. 86 (3) , 286-294
On Path Convex Ramsey Numbers
In this article, we will first find the path convex Ramsey numbers for two‐colorings. Then using this, we will deduce some bounds for path convex Ramsey numbers for multicolorings. Next, we will find the convex Ramsey numbers for convex paths versus any graph containing a convex cycle, for convex paths versus stars, and for convex cycles versus stars.
- 21 March 2017
- Published by Wiley in Journal of Graph Theory
- Vol. 86 (3) , 286-294
On Path Convex Ramsey Numbers
In this article, we will first find the path convex Ramsey numbers for two‐colorings. Then using this, we will deduce some bounds for path convex Ramsey numbers for multicolorings. Next, we will find the convex Ramsey numbers for convex paths versus any graph containing a convex cycle, for convex paths versus stars, and for convex cycles versus stars.
- 1 January 2009
- Published by Taylor & Francis in The College Mathematics Journal
- Vol. 40 (1) , 65-67
Book Reviews
- 1 January 2009
- Published by Taylor & Francis in The College Mathematics Journal
- Vol. 40 (1) , 65-67
Book Reviews
- Open Access
Ramsey Goodness and Beyond
In a seminal paper from 1983, Burr and Erdos started the systematic study of Ramsey numbers of cliques vs. large sparse graphs, raising a number of problems. In this paper we develop a new approach to such Ramsey problems using a mix of the Szemeredi regularity lemma, embedding of sparse graphs, Turan type stability, and other structural results. We give exact Ramsey numbers for various classes of graphs, solving all but one of the Burr-Erdos problems.
Open AccessRamsey Goodness and Beyond
In a seminal paper from 1983, Burr and Erdos started the systematic study of Ramsey numbers of cliques vs. large sparse graphs, raising a number of problems. In this paper we develop a new approach to such Ramsey problems using a mix of the Szemeredi regularity lemma, embedding of sparse graphs, Turan type stability, and other structural results. We give exact Ramsey numbers for various classes of graphs, solving all but one of the Burr-Erdos problems.
- 1 October 2005
- Published by Wiley in Random Structures & Algorithms
- Vol. 27 (3) , 379-400
Book Ramsey numbers. I
- 1 October 2005
- Published by Wiley in Random Structures & Algorithms
- Vol. 27 (3) , 379-400
Book Ramsey numbers. I
- 1 July 2005
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 14 (5-6) , 851-860
Book Ramsey Numbers and Quasi-Randomness
A set of n triangles sharing a common edge is called a book with n pages and is denoted by edges of the same colour as the book.As an application we find the Ramsey number for a class of graphs.
- 1 July 2005
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 14 (5-6) , 851-860
Book Ramsey Numbers and Quasi-Randomness
A set of n triangles sharing a common edge is called a book with n pages and is denoted by edges of the same colour as the book.As an application we find the Ramsey number for a class of graphs.
- 18 March 2005
- Published by Wiley in Journal of Graph Theory
- Vol. 49 (2) , 168-176
A note on Ramsey numbers for books
The book with n pages Bn is the graph consisting of n triangles sharing an edge. The book Ramsey number r(Bm,Bn) is the smallest integer r such that either Bm ⊂ G or Bn ⊂ G for every graph G of order r. We prove that there exists a positive constant c such that r(Bm,Bn) = 2n + 3 for all n ≥ cm. Our proof is based mainly on counting; we also use a result of Andrásfai, Erdős, and Sós stating that triangle‐free graphs of order n and minimum degree greater than 2n/5 are bipartite. © 2005 Wiley Periodicals, Inc. J Graph Theory
- 18 March 2005
- Published by Wiley in Journal of Graph Theory
- Vol. 49 (2) , 168-176
A note on Ramsey numbers for books
The book with n pages Bn is the graph consisting of n triangles sharing an edge. The book Ramsey number r(Bm,Bn) is the smallest integer r such that either Bm ⊂ G or Bn ⊂ G for every graph G of order r. We prove that there exists a positive constant c such that r(Bm,Bn) = 2n + 3 for all n ≥ cm. Our proof is based mainly on counting; we also use a result of Andrásfai, Erdős, and Sós stating that triangle‐free graphs of order n and minimum degree greater than 2n/5 are bipartite. © 2005 Wiley Periodicals, Inc. J Graph Theory
- Open Access
A note on Ramsey Numbers for Books
A book of size N is the union of N triangles sharing a common edge. We show that the Ramsey number of a book of size N vs. a book of size M equals 2N+3 for all N>(10^6)M. Our proof is based on counting.
Open AccessA note on Ramsey Numbers for Books
A book of size N is the union of N triangles sharing a common edge. We show that the Ramsey number of a book of size N vs. a book of size M equals 2N+3 for all N>(10^6)M. Our proof is based on counting.
- 1 November 2003
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 12 (5-6) , 653-660
Mixed Ramsey Numbers Revisited
Given a graph Hwith no isolates, the (generalized) mixed Ramsey number is the smallest integer r such that every H-free graph of order r contains an m-element irredundant set. We consider some questions concerning the asymptotic behaviour of this number (i) with H fixed and , (ii) with m fixed and a sequence of dense graphs, in particular for the sequence . Open problems are mentioned throughout the paper.
- 1 November 2003
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 12 (5-6) , 653-660
Mixed Ramsey Numbers Revisited
Given a graph Hwith no isolates, the (generalized) mixed Ramsey number is the smallest integer r such that every H-free graph of order r contains an m-element irredundant set. We consider some questions concerning the asymptotic behaviour of this number (i) with H fixed and , (ii) with m fixed and a sequence of dense graphs, in particular for the sequence . Open problems are mentioned throughout the paper.
- Open Access
A generatingfunctionology approach to a problem of Wilf
Wilf posed the following problem: determine asymptotically as $n\to\infty$ the probability that a randomly chosen part size in a randomly chosen composition of n has multiplicity m. One solution of this problem was given by Hitczenko and Savage. In this paper, we study this question using the techniques of generating functions and singularity analysis.Open AccessA generatingfunctionology approach to a problem of Wilf
Wilf posed the following problem: determine asymptotically as $n\to\infty$ the probability that a randomly chosen part size in a randomly chosen composition of n has multiplicity m. One solution of this problem was given by Hitczenko and Savage. In this paper, we study this question using the techniques of generating functions and singularity analysis. - Open Access
- 1 January 2001
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 8 (1) , R17
Asymptotic Bounds for Bipartite Ramsey Numbers
The bipartite Ramsey number $b(m,n)$ is the smallest positive integer $r$ such that every (red, green) coloring of the edges of $K_{r,r}$ contains either a red $K_{m,m}$ or a green $K_{n,n}$. We obtain asymptotic bounds for $b(m,n)$ for $m \geq 2$ fixed and $n \rightarrow \infty$.- 1 January 2001
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 8 (1) , R17
Open AccessAsymptotic Bounds for Bipartite Ramsey Numbers
The bipartite Ramsey number $b(m,n)$ is the smallest positive integer $r$ such that every (red, green) coloring of the edges of $K_{r,r}$ contains either a red $K_{m,m}$ or a green $K_{n,n}$. We obtain asymptotic bounds for $b(m,n)$ for $m \geq 2$ fixed and $n \rightarrow \infty$.