Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs
Y. Ma, D. Mattiolo, E. Steffen, I.H. Wolf, Combinatorica 44 (2024) 429–440.
Download
No fulltext has been uploaded.
Journal Article
| Published
| English
Author
Department
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(2l, r) ≤ 3l − 6 for every l ≥ 3 and r ≥ 2l.
Publishing Year
Journal Title
Combinatorica
Volume
44
Page
429-440
LibreCat-ID
Cite this
Ma Y, Mattiolo D, Steffen E, Wolf IH. Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs. Combinatorica. 2024;44:429-440. doi:10.1007/s00493-023-00078-9
Ma, Y., Mattiolo, D., Steffen, E., & Wolf, I. H. (2024). Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs. Combinatorica, 44, 429–440. https://doi.org/10.1007/s00493-023-00078-9
@article{Ma_Mattiolo_Steffen_Wolf_2024, title={Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs}, volume={44}, DOI={10.1007/s00493-023-00078-9}, journal={Combinatorica}, publisher={Springer Science and Business Media LLC}, author={Ma, Yulai and Mattiolo, Davide and Steffen, Eckhard and Wolf, Isaak Hieronymus}, year={2024}, pages={429–440} }
Ma, Yulai, Davide Mattiolo, Eckhard Steffen, and Isaak Hieronymus Wolf. “Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs.” Combinatorica 44 (2024): 429–40. https://doi.org/10.1007/s00493-023-00078-9.
Y. Ma, D. Mattiolo, E. Steffen, and I. H. Wolf, “Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs,” Combinatorica, vol. 44, pp. 429–440, 2024, doi: 10.1007/s00493-023-00078-9.
Ma, Yulai, et al. “Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs.” Combinatorica, vol. 44, Springer Science and Business Media LLC, 2024, pp. 429–40, doi:10.1007/s00493-023-00078-9.
Google Scholar