Bibliographic Details
| Title: |
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs. |
| Authors: |
Ma, Yulai, Mattiolo, Davide, Steffen, Eckhard, Wolf, Isaak H. |
| Superior Title: |
Combinatorica; Apr2024, Vol. 44 Issue 2, p429-440, 12p |
| Subject Terms: |
REGULAR graphs, BIPARTITE graphs |
| Abstract: |
For 0 ≤ t ≤ r let m(t, r) be the maximum number s such that every t-edge-connected r-graph has s pairwise disjoint perfect matchings. There are only a few values of m(t, r) known, for instance m (3 , 3) = m (4 , r) = 1 , and m (t , r) ≤ r - 2 for all t ≠ 5 , and m (t , r) ≤ r - 3 if r is even. We prove that m (2 l , r) ≤ 3 l - 6 for every l ≥ 3 and r ≥ 2 l . [ABSTRACT FROM AUTHOR] |
|
Copyright of Combinatorica is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
