We show that the number of anti-lecture hall compositions of n with the first entry not exceeding k − 2 equals the number of overpartitions of n with non-overlined parts not con...
William Y. C. Chen, Doris D. M. Sang, Diane Y. H. ...
The circumference of a graph is the length of its longest cycles. Results of Jackson, and Jackson and Wormald, imply that the circumference of a 3-connected cubic n-vertex graph i...
We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz [7], to obtain several sharp bounds on the number of incidences between lines and points in three ...
We investigate finite 3-nets embedded in a projective plane over a (finite or infinite) field of any characteristic p. Such an embedding is regular when each of the three clas...
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...