A generalization of the Davenport constant is investigated. For a finite abelian group G and a positive integer k, let Dk(G) denote the smallest such that each sequence over G of l...
It is proved that, if G is a K4-minor-free graph with maximum degree 4, then G is totally ( + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ...
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...