On the maximum density of fixed strongly connected subtournaments

Coregliano, Leonardo N.; Parente, Roberto F.; Sato, Cristiane M.

Advanced search

Search - Use quotation marks to get a more specific result

Index

Field of knowledge

Start date

Betweenand

(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

On the maximum density of fixed strongly connected subtournaments

Full text
Author(s):	Coregliano, Leonardo N. ^[1] ; Parente, Roberto F. ^[2] ; Sato, Cristiane M. ^[3] Total Authors: 3
Affiliation:	^[1] Univ Sao Paulo, Inst Math & Stat, Sao Paulo - Brazil ^[2] Univ Fed Bahia, Dept Comp Sci, Salvador, BA - Brazil ^[3] Univ Fed ABC, Ctr Math Comp & Cognit, Sao Paulo - Brazil Total Affiliations: 3
Document type:	Journal article
Source:	ELECTRONIC JOURNAL OF COMBINATORICS; v. 26, n. 1 MAR 22 2019.
Web of Science Citations:	0
Abstract
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. (AU)

FAPESP's process:	13/23720-9 - The Asymptotic Combinatorics of Permutations and Flag Algebras
Grantee:	Leonardo Nagami Coregliano
Support Opportunities:	Scholarships in Brazil - Master

Short URL