## 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,
✦ LIBER ✦
A theorem on the principal structure for independent matchings
✍ Scribed by Satoru Iwata; Kazuo Murota
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 877 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A Gallai–Edmonds-type structure theorem
✍
Bianca Spille; László Szegő
📂
Article
📅
2004
🏛
John Wiley and Sons
🌐
English
⚖ 122 KB
An Asymptotic Independence Theorem for t
✍
Elmar Teufl; Stephan Wagner
📂
Article
📅
2009
🏛
Springer Japan
🌐
English
⚖ 172 KB
On the Erdős-Ginzburg-Ziv theore
✍
A. Bialostocki; P. Dierker
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 511 KB
On a Lifting Theorem for the Structured
✍
H. Bercovici; G. Foias; P.P. Khargonekar; A. Tannenbaum
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 328 KB
A note on the principal theorems in the
✍
Du Nailin; Zeng Xianwu
📂
Article
📅
1997
🏛
Wuhan University
🌐
English
⚖ 198 KB
A limit theorem for randomly stopped ind
✍
Peter Becker–Kern; Gyula Pap
📂
Article
📅
2007
🏛
John Wiley and Sons
🌐
English
⚖ 230 KB
👁 1 views
## Abstract In the spirit of the classical random central limit theorem a general limit theorem for random stopping in the scheme of infinitesimal triangular arrays on a separable metrizable group is presented. The approach incorporates and generalizes earlier results for normalized sequences of in