✦ LIBER ✦

Majorization, packing, covering and matroids

✍ Scribed by Zbigniew Lonc

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 453 KB
Volume: 121
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90548-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing and covering dense graphs

✍ Noga Alon; Yair Caro; Raphael Yuster 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB 👁 1 views

Extremal packing and covering sets

✍ Rajinder Jeet Hans 📂 Article 📅 1967 🏛 Springer Vienna 🌐 English ⚖ 440 KB

Transversal matroid intersections and re

Transversal matroid intersections and related packings

✍ David B. Weinberger 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 697 KB

Packing and Covering Groups with Subgrou

Packing and Covering Groups with Subgroups

✍ D. Jungnickel; L. Storme 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 182 KB

We study the problem of covering or packing a finite group with subgroups of a specified order and obtain bounds on the size of such covers and packings. Our main results provide characterizations of the elementary abelian groups by the existence of large packings or small covers, respectively. Henc

Hardness of lazy packing and covering

✍ Ling Gai; Guochuan Zhang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 682 KB

Packing and covering triangles in graphs

✍ P.E. Haxell 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 184 KB

It is shown that if G is a graph such that the maximum size of a set of pairwise edge-disjoint triangles is v(G), then there is a set C of edges of G of size at most (3 -e)v(G) such that E(T) N C 7~ 0 for every triangle T of G, where e> 3. This is the first nontrivial bound known for a long-standing