𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A solution of Hadwiger's covering problem for zonoids

✍ Scribed by V. G. Boltjanski; P. S. Soltan

Publisher
Springer-Verlag
Year
1992
Tongue
English
Weight
389 KB
Volume
12
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Solution of a covering problem related t
Solution of a covering problem related to labelled tournaments
✍ Sgall, Ji?οΏ½ πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 462 KB πŸ‘ 2 views

Suppose we have a tournament with edges labelled so that the edges incident with any vertex have at most k distinct labels (and no vertex has outdegree 0). Let m be the minimal size of a subset of labels such that for any vertex there exists an outgoing edge labelled by one of the labels in the subs

On Hadwiger's numberβ€” a problem of the N
On Hadwiger's numberβ€” a problem of the Nordhaus-Gaddum type
✍ M. Stiebitz πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 700 KB

Stiebitz, M., On Hadwiger's number-A problem of the Nordhaus-Gaddum type, Discrete Mathematics 101 (1992) 307-317. The Hadwiger number of a graph G = (V, E), denoted by q(G), is the maximum size of a complete graph to which G can be contracted. Let %((n, k):= {G 1 IV(G)1 = n and n(G) = k}. We shall

A Covering Problem for Tori
A Covering Problem for Tori
✍ PatricR.J. Γ–stergΓ₯rd; Taneli Riihonen πŸ“‚ Article πŸ“… 2003 πŸ› Springer 🌐 English βš– 171 KB
A covering problem for plane lattices
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 ~.