On the maximum density of fixed strongly connected subtournaments
From MaRDI portal
Publication:1733920
zbMath1407.05103arXiv1505.05200MaRDI QIDQ1733920
Cristiane M. Sato, Roberto F. Parente, Leonardo Nagami Coregliano
Publication date: 22 March 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.05200
Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Density (toughness, etc.) (05C42)
Related Items
Quasirandom-Forcing Orientations of Cycles ⋮ Tournament quasirandomness from local counting ⋮ Cycles of a given length in tournaments ⋮ No additional tournaments are quasirandom-forcing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Note on upper density of quasi-random hypergraphs
- A measure-theoretic approach to the theory of dense hypergraphs
- Monochromatic triangles in three-coloured graphs
- A problem of Erdős on the minimum number of \(k\)-cliques
- Limits of dense graph sequences
- Quasirandom permutations
- Limits of permutation sequences
- Quasirandom permutations are characterized by 4-point densities
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs
- Quasi-Random Oriented Graphs
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations
- Quasi-random hypergraphs revisited
- WHAT IS... a Flag Algebra?
- Quasi-random tournaments
- Quasi-random hypergraphs
- Graph limits and exchangeable random graphs
- CSDP, A C library for semidefinite programming
- Quasi‐carousel tournaments
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- On the Density of Transitive Tournaments
- A Note on Even Cycles and Quasirandom Tournaments
- The Maximum Number of Strongly Connected Subtournaments*
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- Undecidability of linear inequalities in graph homomorphism densities
- Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
- Flag algebras
- Quasi-random graphs
