𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Atoms of set systems with a fixed number of pairwise unions

✍ Scribed by P.E. Haxell

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
593 KB
Volume
150
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Integer Plane Multiflows with a Fixed Nu
Integer Plane Multiflows with a Fixed Number of Demands
✍ A. Sebo πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 371 KB

We give a polynomial algorithm which decides the integer solvability of multicommodity flow problems where the union of "capacity-" and "demand-edges" forms a planar graph, and the number of demand edges is bounded by a prefixed integer \(k\). This problem was solved earlier for \(k=2\) by Seymour a

On graphs with a fixed number of negativ
On graphs with a fixed number of negative eigenvalues
✍ Aleksander TorgaΕ‘ev πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 374 KB

Let P(n) be the class of all connected graphs having exactly n ~> 1 negative eigenvalues (including their multiplicities). In this paper we prove that the class P(n) contains only finitely many so-called canonical graphs. The analogous statement for the class Q(n) of all connected graphs having exac

Note on the reconstruction of infinite g
Note on the reconstruction of infinite graphs with a fixed finite number of components
✍ Thomas Andreae πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 169 KB πŸ‘ 1 views

For every positive integer c , we construct a pair G, , H, of infinite, nonisomorphic graphs both having exactly c components such that G, and H, are hypomorphic, i.e., G, and H, have the same families of vertex-deleted subgraphs. This solves a problem of Bondy and Hemminger. Furthermore, the pair G