On $(1,2)$-step competition graphs of multipartite tournaments
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909111324508160 |
|---|---|
| author | Choi, Myungho Kim, Suh-Ryung |
| author_facet | Choi, Myungho Kim, Suh-Ryung |
| contents | A multipartite tournament is an orientation of a complete $k$-partite graph for some positive integer $k\geq 3$. We say that a multipartite tournament $D$ is tight if every partite set forms a clique in the $(1,2)$-step competition graph, denoted by $C_{1,2}(D)$, of $D$. In this paper, we completely characterize $C_{1,2}(D)$ for a tight multipartite tournament $D$. We will study $C_{1,2}(D)$ for a multipartite tournament $D$ that is not tight in a follow up paper. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_17817 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On $(1,2)$-step competition graphs of multipartite tournaments Choi, Myungho Kim, Suh-Ryung Combinatorics 05C20, 05C75 A multipartite tournament is an orientation of a complete $k$-partite graph for some positive integer $k\geq 3$. We say that a multipartite tournament $D$ is tight if every partite set forms a clique in the $(1,2)$-step competition graph, denoted by $C_{1,2}(D)$, of $D$. In this paper, we completely characterize $C_{1,2}(D)$ for a tight multipartite tournament $D$. We will study $C_{1,2}(D)$ for a multipartite tournament $D$ that is not tight in a follow up paper. |
| title | On $(1,2)$-step competition graphs of multipartite tournaments |
| topic | Combinatorics 05C20, 05C75 |
| url | https://arxiv.org/abs/2401.17817 |