𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a Gallai-type problem for lattices

✍ Scribed by T. Hausel

Publisher
Akadmiai Kiad
Year
1995
Tongue
English
Weight
917 KB
Volume
66
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A gallai-type problem
A gallai-type problem
✍ V.J Baston; F.A Bostock 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 180 KB
A Gallai–Edmonds-type structure theorem
A Gallai–Edmonds-type structure theorem for path-matchings
✍ Bianca Spille; László Szegő 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract As a generalization of matchings, Cunningham and Geelen introduced the notion of path‐matchings. We give a structure theorem for path‐matchings which generalizes the fundamental Gallai–Edmonds structure theorem for matchings. Our proof is purely combinatorial. © 2004 Wiley Periodicals,

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 ~.