Hall's Harem Theorem with controlled sizes of cycles
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914576974479360 |
|---|---|
| author | Duda, Karol |
| author_facet | Duda, Karol |
| contents | We prove a new version of Hall's Harem Theorem, where the final matching is realized by a unary function with additional conditions on behavior of cycles. The present paper can be considered as a helpful companion of the paper of the author: arXiv:2105.06304, where a computable version of Hall's Harem Theorem with controlled sizes of cycles is proved. These two versions of Hall's Harem Theorem are independent: none of them follows from the other one. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_20724 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Hall's Harem Theorem with controlled sizes of cycles Duda, Karol Combinatorics Logic We prove a new version of Hall's Harem Theorem, where the final matching is realized by a unary function with additional conditions on behavior of cycles. The present paper can be considered as a helpful companion of the paper of the author: arXiv:2105.06304, where a computable version of Hall's Harem Theorem with controlled sizes of cycles is proved. These two versions of Hall's Harem Theorem are independent: none of them follows from the other one. |
| title | Hall's Harem Theorem with controlled sizes of cycles |
| topic | Combinatorics Logic |
| url | https://arxiv.org/abs/2511.20724 |