Treffer: On the Maximum Density of Fixed Strongly Connected Subtournaments
Title:
On the Maximum Density of Fixed Strongly Connected Subtournaments
Source:
The Electronic Journal of Combinatorics. 26
Publication Status:
Preprint
Publisher Information:
The Electronic Journal of Combinatorics, 2019.
Publication Year:
2019
Subject Terms:
FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Physics, Graph Spectra and Topological Indices, 0102 computer and information sciences, Discrete mathematics, Limits and Structures in Graph Theory, Quantum mechanics, 01 natural sciences, Quasirandomness, Computational Theory and Mathematics, Combinatorics, Computer Science, Physical Sciences, FOS: Mathematics, Mathematics - Combinatorics, Discrete Mathematics and Combinatorics, Maximum density, Combinatorics (math.CO), Geometry and Topology, 0101 mathematics, Tournament, Mathematics, Computer Science - Discrete Mathematics, Graph Theory and Algorithms
Document Type:
Fachzeitschrift
Article<br />Other literature type
ISSN:
1077-8926
DOI:
10.37236/6557
DOI:
10.60692/xmcbg-8cm21
DOI:
10.48550/arxiv.1505.05200
DOI:
10.60692/ymx8h-asg62
Access URL:
https://www.combinatorics.org/ojs/index.php/eljc/article/download/v26i1p44/pdf
http://arxiv.org/abs/1505.05200
https://ui.adsabs.harvard.edu/abs/2015arXiv150505200C/abstract
https://dblp.uni-trier.de/db/journals/corr/corr1505.html#ParenteS15
https://bv.fapesp.br/pt/publicacao/163924/on-the-maximum-density-of-fixed-strongly-connected-subtourna/
http://arxiv.org/abs/1505.05200
https://ui.adsabs.harvard.edu/abs/2015arXiv150505200C/abstract
https://dblp.uni-trier.de/db/journals/corr/corr1505.html#ParenteS15
https://bv.fapesp.br/pt/publicacao/163924/on-the-maximum-density-of-fixed-strongly-connected-subtourna/
Rights:
CC BY
arXiv Non-Exclusive Distribution
arXiv Non-Exclusive Distribution
Accession Number:
edsair.doi.dedup.....2aa9cd497e033d0d94cd24a16470f6ea
Database:
OpenAIRE
Weitere Informationen
We study the density of fixed strongly connected subtournaments on 5 vertices in large tournaments. We determine the maximum density asymptotically for five tournaments as well as unique extremal sequences for each tournament. As a byproduct we also characterize tournaments that are recursive blow-ups of a 3-cycle as tournaments that avoid three specific tournaments of size 5.