Borel fractional perfect matchings in quasi-transitive amenable graphs
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913650932973568 |
|---|---|
| author | Murray, Sam |
| author_facet | Murray, Sam |
| contents | We show that if a locally finite Borel graph with quasitransitive amenable components admits a fractional perfect matching, it will admit a Borel fractional perfect matching. In particular, if a countable amenable quasitransitive graph admits a fractional perfect matching then its Bernoulli graph admits a Borel fractional perfect matching. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_07352 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Borel fractional perfect matchings in quasi-transitive amenable graphs Murray, Sam Logic Combinatorics We show that if a locally finite Borel graph with quasitransitive amenable components admits a fractional perfect matching, it will admit a Borel fractional perfect matching. In particular, if a countable amenable quasitransitive graph admits a fractional perfect matching then its Bernoulli graph admits a Borel fractional perfect matching. |
| title | Borel fractional perfect matchings in quasi-transitive amenable graphs |
| topic | Logic Combinatorics |
| url | https://arxiv.org/abs/2501.07352 |