A covering problem

A cyclic integer covering problem

✍ Götz Uebe; Martin Schäfer; Reinhold Kitta 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 421 KB

A Covering Problem for Tori

✍ PatricR.J. Östergård; Taneli Riihonen 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 171 KB

Covering Graphs: The Covering Problem So

Covering Graphs: The Covering Problem Solved

✍ Yair Caro; Raphael Yuster 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 238 KB

For every fixed graph H, we determine the H-covering number of K n , for all n>n 0 (H ). We prove that if h is the number of edges of H, and gcd(H )=d is the greatest common divisor of the degrees of H, then there exists n 0 =n 0 (H ), such that for all n>n 0 , Our main tool in proving this result

A covering problem over finite rings

✍ I.N. Nakaoka; O.J.N.T.N. dos Santos 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 467 KB

Given a finite commutative ring with identity A, define c(A, n, R) as the minimum cardinality of a subset H of A n which satisfies the following property: every element in A n differs in at most R coordinates from a multiple of an element in H. In this work, we determine the numbers c(Z m , n, 0) fo

Solving a fuzzy set-covering problem

✍ M.J. Hwang; C.I. Chiang; Y.H. Liu 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 249 KB

A covering problem for plane lattices

✍ Salvatore Vassallo 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 491 KB

Let &a be a plane lattice and {vl, v2} a Minkowski reduced base of ~. In this note we prove that ifa convex body X has minimal width w(X')/> Iv2[ sin ~p + Ivll(x/3/2), where ~o is the acute angle between vl and v2, then X" is a covering set for ~.