Classification de certaines matrices 0–1
✍ Scribed by J.D. MacAllister; M. Sakarovitch
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 723 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
This paper is a survey of the main propertics of special O-1 matrices. All thcsc prcrpertles are presented in a unified bmework (in terms of matrices and not in terms of hypergraphs). The paper contains no original result and no proof. NuI doute que I'une des idles de Bcrge quand il a introduit le concept d'hypergraphe ait et6 d'utiliser le tangage tres image et les methodes de la thiiorie des graphes pour etudier les matrices dont les ClOments valent 0 ou 1, considerees comme gdneralisation des matrices d'incidence aux a&es des graphes non orient&. L'un des inter&s de la theorie des hypergraphes telle qu'elle a Cte d&eloppCe par Berge est de mettre en kvidence Ie fait que certains concepts de ia theorie des graphes peuvent se genkraliser de plusieurs man&es ditlkzntes suiv;lnt la propriete caract&istique qu'on choisit de conservcr et la man&-e dont on envisage d'effectuer cette generalisation. Ainsi, par exemple, si on concentre son intCr& sur
📜 SIMILAR VOLUMES
We define a 0,1 matrix \(M\) to be ideal if all vertices of the polyhedron \(\{x: M x \geqslant 1\), \(x \geqslant 0\}\) have only 0,1 components. We expand the list of known minor minimal nonideal matrices by several thousand. Many of these examples are obtained polyhedrally, by constructing new mi
A 0, \1 matrix is balanced if, in every square submatrix with two nonzero entries per row and column, the sum of the entries is a multiple of four. This paper extends the decomposition of balanced 0, 1 matrices obtained by Conforti, Cornue jols, and Rao (1999, J. Combin. Theory Ser. B 77, 292 406) t