On the maximum density of fixed strongly connected subtournaments (Q1733920): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimum Number of Monotone Subsequences of Length 4 in Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Number of Strongly Connected Subtournaments<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on upper density of quasi-random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-random hypergraphs revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-random tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5730677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasirandom permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi‐carousel tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Density of Transitive Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic triangles in three-coloured graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem of Erdős on the minimum number of \(k\)-cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph limits and exchangeable random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure-theoretic approach to the theory of dense hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Random Oriented Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of linear inequalities in graph homomorphism densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of permutation sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Even Cycles and Quasirandom Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasirandom permutations are characterized by 4-point densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of dense graph sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Number of<i>k</i>-Cliques in Graphs with Bounded Independence Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flag algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-Hypergraphs with Forbidden 4-Vertex Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: WHAT IS... a Flag Algebra? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latest Developments in the SDPA Family for Solving Large-Scale SDPs / rank
 
Normal rank

Latest revision as of 20:28, 18 July 2024

scientific article
Language Label Description Also known as
English
On the maximum density of fixed strongly connected subtournaments
scientific article

    Statements

    On the maximum density of fixed strongly connected subtournaments (English)
    0 references
    22 March 2019
    0 references
    Summary: 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.
    0 references
    locally transitive tournament
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references