In this paper we continue our investigations from [HM01] regarding spanning subgraphs which imply the existence of cycle double covers. We prove that if a cubic graph G has a spann...
The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions ...
We provide a new algorithm for indefinite nested summation which is applicable to summands involving unspecified sequences x(n). More than that, we show how to extend Karr's ...
Let F be a family of translates of a fixed convex set M in Rn. Let (F) and (F) denote the transversal number and the independence number of F, respectively. We show that (F) (F) 8...
Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pels...
Abstract. We present some simple observations on factors of the qbinomial coefficients, the q-Catalan numbers, and the q-multinomial coefficients. Writing the Gaussian coefficient ...