The Dimension of the Region of Feasible Tournament Profiles

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F25%3A00144084" target="_blank" >RIV/00216224:14330/25:00144084 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1137/23M1613372" target="_blank" >https://doi.org/10.1137/23M1613372</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1137/23M1613372" target="_blank" >10.1137/23M1613372</a>

Result language
angličtina
Original language name
The Dimension of the Region of Feasible Tournament Profiles
Original language description
Erdös, 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 nontrivial 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.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)