✦ LIBER ✦

Note on the path-matching formula

✍ Scribed by András Frank; László Szegő

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 112 KB
Volume: 41
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.10055

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

As a common generalization of matchings and matroid intersections, W.H. Cunningham and J.F. Geelen introduced the notion of path‐matchings. They proved a min‐max formula for the maximum value. Here, we exhibit a simplified version of their min‐max theorem and provide a purely combinatorial proof. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 110–119, 2002

📜 SIMILAR VOLUMES

A note on the constrained shortest-path

A note on the constrained shortest-path problem

✍ Arun K. Pujari; Suneeta Agarwal; V. P. Gulati 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 1 views

A note on extension of the lagrange inve

A note on extension of the lagrange inversion formula

✍ J. K. Percus 📂 Article 📅 1964 🏛 John Wiley and Sons 🌐 English ⚖ 362 KB 👁 1 views

A note on finding shortest path trees

✍ Aaron Kershenbaum 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 1 views

A note on the matching numbers of triang

A note on the matching numbers of triangle-free graphs

✍ Roberto W. Frucht; Reinaldo E. Giudici 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 1 views

Notes on three U. S. P. formulas

✍ Egan, Thomas A. 📂 Article 📅 1912 🏛 Elsevier ⚖ 124 KB 👁 1 views

A Note on a Generalization of Waring's F

A Note on a Generalization of Waring's Formula

✍ John Konvalina 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 67 KB

We show Zeng's ''corrected'' form of the generalized Waring formula is, in fact, equivalent to Konvalina's original form.