Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2405.18446 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913368061771776 |
|---|---|
| author | Kuyanov, Fedor |
| author_facet | Kuyanov, Fedor |
| contents | In this paper, we prove two lower bounds for the maximum matching size in an arbitrary undirected graph. Despite their simplicity, these results are not widely known. This article aims to bring pleasure to the reader by giving short combinatorial proofs of these easy-to-state estimates. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_18446 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Two lower bounds for maximum matching Kuyanov, Fedor Combinatorics 05C70 In this paper, we prove two lower bounds for the maximum matching size in an arbitrary undirected graph. Despite their simplicity, these results are not widely known. This article aims to bring pleasure to the reader by giving short combinatorial proofs of these easy-to-state estimates. |
| title | Two lower bounds for maximum matching |
| topic | Combinatorics 05C70 |
| url | https://arxiv.org/abs/2405.18446 |