The dimension of the region of feasible tournament profiles

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Kral, Daniel, Lamaison, Ander, Prorok, Magdalena, Shu, Xichao
Format: Preprint
Veröffentlicht: 2023
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910477067485184
author Kral, Daniel
Lamaison, Ander
Prorok, Magdalena
Shu, Xichao
author_facet Kral, Daniel
Lamaison, Ander
Prorok, Magdalena
Shu, Xichao
contents Erd\H os, Lovász and Spencer showed in the late 1970s that the dimension of the region of $k$-vertex graph profiles, i.e., the region of feasible densities of $k$-vertex graphs in large graphs, is equal to the number of non-trivial connected graphs with at most $k$ vertices. We determine the dimension of the region of $k$-vertex tournament profiles. Our result, which explores an interesting connection to Lyndon words, yields that the dimension is much larger than just the number of strongly connected tournaments, which would be the answer expected as the analogy to the setting of graphs.
format Preprint
id arxiv_https___arxiv_org_abs_2310_19482
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle The dimension of the region of feasible tournament profiles
Kral, Daniel
Lamaison, Ander
Prorok, Magdalena
Shu, Xichao
Combinatorics
Erd\H os, Lovász and Spencer showed in the late 1970s that the dimension of the region of $k$-vertex graph profiles, i.e., the region of feasible densities of $k$-vertex graphs in large graphs, is equal to the number of non-trivial connected graphs with at most $k$ vertices. We determine the dimension of the region of $k$-vertex tournament profiles. Our result, which explores an interesting connection to Lyndon words, yields that the dimension is much larger than just the number of strongly connected tournaments, which would be the answer expected as the analogy to the setting of graphs.
title The dimension of the region of feasible tournament profiles
topic Combinatorics
url https://arxiv.org/abs/2310.19482