The delta-sum of matching delta-matroids
✍ Scribed by André Bouchet; Werner Schwärzler
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 574 KB
- Volume
- 181
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
We discuss a composition operation of delta-matroids, called delta-sum, in relation to similar compositions of related combinatorial structures like matroids and jump systems. The delta-sum of matching delta-matroids is associated with the linkings of a graph. We exhibit a min-max formula for the polyhedral rank function of that delta-matroid, which implies a result of Gallai on linkings.
📜 SIMILAR VOLUMES
A main result proved in this paper is the following. Theorem. Let G be a noncomplete graph on n vertices with degree sequence where R is the zero-sum Ramsey number.
## Abstract We prove the following generalization of earlier results of Bialostocki and Dierker [3] and Caro [7]. Theorem. Let __t__ ⩾ __k__ ⩾ 2 be positive integers such that __k__ | __t__, and let __c :E__(K) → ℤ~__k__~ be a mapping of all the __r__‐subsets of an __rt__ + __k__ −1 element set in
In 1954 Mississippi, Jack Branch returns to his father's Delta estate, Great Oaks, to perform an act of noblesse oblige: teaching at the local high school.While conducting a class on evil throughout history, Jack is shocked to discover that his unassuming student Eddie is the son of the Coed Killer,