## Abstract As a generalization of matchings, Cunningham and Geelen introduced the notion of path‐matchings. We give a structure theorem for path‐matchings which generalizes the fundamental Gallai–Edmonds structure theorem for matchings. Our proof is purely combinatorial. © 2004 Wiley Periodicals,
Fractional matchings and the Edmonds-Gallai theorem
✍ Scribed by W.R Pulleyblank
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 542 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
The article is concerned with the Bourgain, Brezis and Mironescu theorem on the asymptotic behaviour of the norm of the Sobolev-type embedding operator: W s;p ! L pn=ðnÀspÞ as s " 1 and s " n=p: Their result is extended to all values of s 2 ð0; 1Þ and is supplied with an elementary proof. The relati
The paper derives minimum theorems that characterise the steady state cyclic state of a body subjected to cyclic load and temperature. The inelastic material behaviour is described by a convex flow potential. The model is chosen to provide an intermediary description between perfect plasticity, for