𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A matroid generalization of theorems of Lewin and Gallai

✍ Scribed by Yoji Kajitani; Shuichi Ueno

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
198 KB
Volume
9
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The colour theorems of Brooks and Gallai
The colour theorems of Brooks and Gallai extended
✍ A.V. Kostochka; M. Stiebitz; B. Wirth πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 283 KB

One of the basic results in graph colouring is Brooks' theorem [-4] which asserts that the chromatic number of every connected graph, that is not a complete graph or an odd cycle, does not exceed its maximum degree. As an extension of this result, Gallai [6] characterized the subgraphs of k-colour-c

A generalization of WROŃSKI theorems
A generalization of WROŃSKI theorems
✍ Danuta Przeworska-Rolewicz πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 402 KB
A Matroid Generalization of a Result on
A Matroid Generalization of a Result on Row-Latin Rectangles
✍ Glenn G. Chappell πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 194 KB

Let A be an m\_n matrix in which the entries of each row are all distinct. A. A. Drisko (1998, J. Combin. Theory Ser. A 84, 181 195) showed that if m 2n&1, then A has a transversal: a set of n distinct entries with no two in the same row or column. We generalize this to matrices with entries in the