๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On a Generalization of a Result of W. G. Cochran

โœ Scribed by D. R. Cox

Book ID
124299559
Publisher
Oxford University Press
Year
2007
Tongue
English
Weight
527 KB
Volume
94
Category
Article
ISSN
0006-3444

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A generalization of a graph result of D.
A generalization of a graph result of D.W. Hall
โœ S.R. Kingan ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 335 KB

D.W. Hall proved that every simple 3-connected graph with a Ks-minor must have a K3.3-minor, the only exception being Ks itself. In this paper, we prove that every 3-connected binary matroid with an M(Ks)-minor must have an M(K3.3)-or M\*(K3,3)-minor, the only exceptions being M(K5), a highly symmet

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