Highly edge-connected regular graphs without large factorizable subgraphs
Combinatorics
2023-04-18 v1
Abstract
We construct highly edge-connected -regular graph which do not contain pairwise disjoint perfect matchings. The results partially answer a question stated by Thomassen [Factorizing regular graphs, J. Comb. Theory Ser. B (2019), https://doi.org/10.1016/j.jctb.2019.05.002 (article in press)].
Keywords
Cite
@article{arxiv.1912.09704,
title = {Highly edge-connected regular graphs without large factorizable subgraphs},
author = {Davide Mattiolo and Eckhard Steffen},
journal= {arXiv preprint arXiv:1912.09704},
year = {2023}
}
Comments
10 pages; submitted for publication