Back to Search
Start Over
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs.
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs.
- Source :
- Combinatorica; Apr2024, Vol. 44 Issue 2, p429-440, 12p
- Publication Year :
- 2024
-
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]
- Subjects :
- REGULAR graphs
BIPARTITE graphs
Subjects
Details
- Language :
- English
- ISSN :
- 02099683
- Volume :
- 44
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- Combinatorica
- Publication Type :
- Academic Journal
- Accession number :
- 176221393
- Full Text :
- https://doi.org/10.1007/s00493-023-00078-9