15 citations · 22 across the 6 of their papers we have counts for
6 papers
How Ramsey theory can be used to solve Harary's problem for
C. J. Jayawardene, C. C. Rousseau, B. Bollobás
Harary's conjecture for every isolated-free graph G with edges was proved independently by Sidorenko and Goddard and Klietman. In this paper instead of $C_3…
Ramsey Goodness and Beyond
Vladimir Nikiforov, Cecil C. Rousseau
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 devel…
A note on Ramsey Numbers for Books
Vladimir Nikiforov, Cecil Rousseau
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…
Book Ramsey numbers I
Vladimir Nikiforov, Cecil Rousseau
A book of size q is the union of q triangles sharing a common edge. We find the exact Ramsey number of books of size q versus books of size p when p<q/6-o(q).
Large generalized books are p-good
Vladimir Nikiforov, Cecil Rousseau
An r-book of size q is a union of q (r+1)-cliques sharing a common r-clique. We find exactly the Ramsey number of a p-clique versus r-books of sufficiently large size. Furthermore,…
A generatingfunctionology approach to a problem of Wilf
Pawel Hitczenko, Cecil C. Rousseau, Carla D. Savage
Wilf posed the following problem: determine asymptotically as the probability that a randomly chosen part size in a randomly chosen composition of n has multiplicity m…