Back to Search
Start Over
Highly edge-connected regular graphs without large factorizable subgraphs
- Source :
- Journal Graph Theory 99 (2021) 107-116
- Publication Year :
- 2019
-
Abstract
- We construct highly edge-connected $r$-regular graph which do not contain $r-2$ 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)].<br />Comment: 10 pages; submitted for publication
- Subjects :
- Mathematics - Combinatorics
Subjects
Details
- Database :
- arXiv
- Journal :
- Journal Graph Theory 99 (2021) 107-116
- Publication Type :
- Report
- Accession number :
- edsarx.1912.09704
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.1002/jgt.22729