Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2601.02999 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917187159064576 |
|---|---|
| author | Geniet, Colin Ghasemi, Fatemeh Kanté, Mamadou Moustapha |
| author_facet | Geniet, Colin Ghasemi, Fatemeh Kanté, Mamadou Moustapha |
| contents | Bojańczyk, Pilipczuk, and Grohe [LICS '18] proved that for graphs of bounded linear clique-width, clique-decompositions of bounded width can be produced by a CMSO transduction. We show that in the case of tournaments, a first-order transduction suffices. This implies that the logics CMSO and existential MSO are equivalent over bounded linear clique-width tournaments. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_02999 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Transducing Linear Decompositions of Tournaments Geniet, Colin Ghasemi, Fatemeh Kanté, Mamadou Moustapha Combinatorics Discrete Mathematics Logic in Computer Science Bojańczyk, Pilipczuk, and Grohe [LICS '18] proved that for graphs of bounded linear clique-width, clique-decompositions of bounded width can be produced by a CMSO transduction. We show that in the case of tournaments, a first-order transduction suffices. This implies that the logics CMSO and existential MSO are equivalent over bounded linear clique-width tournaments. |
| title | Transducing Linear Decompositions of Tournaments |
| topic | Combinatorics Discrete Mathematics Logic in Computer Science |
| url | https://arxiv.org/abs/2601.02999 |