Quasi-random tournaments
From MaRDI portal
Publication:3351382
DOI10.1002/jgt.3190150206zbMath0728.05025OpenAlexW2066050841WikidataQ105723961 ScholiaQ105723961MaRDI QIDQ3351382
Fan R. K. Chung, Ronald L. Graham
Publication date: 1991
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190150206
Related Items
Lower bound on the size of a quasirandom forcing set of permutations, Embedding graphs with bounded degree in sparse pseudorandom graphs, Quasi-Random Set Systems, Minimizing cycles in tournaments and normalized \(q\)-norms, Quasirandom permutations are characterized by 4-point densities, Quasi-randomness of graph balanced cut properties, A Note on Even Cycles and Quasirandom Tournaments, Quasirandom-Forcing Orientations of Cycles, Natural quasirandomness properties, Quasirandom Latin squares, The codegree threshold of \(K_4^-\), The localization game on oriented graphs, Extremal results on feedback arc sets in digraphs, Interlacing families and the Hermitian spectral norm of digraphs, Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets, Semantic limits of dense combinatorial objects, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, FORCING QUASIRANDOMNESS WITH TRIANGLES, On the maximum density of fixed strongly connected subtournaments, Quasi-random subsets of \(\mathbb{Z}_ n\), Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets, The effect of induced subgraphs on quasi-randomness, Quasirandomness in hypergraphs, Tournament quasirandomness from local counting, On the largest eigenvalue of a mixed graph with partial orientation, On explicit random-like tournaments, Characterization of quasirandom permutations by a pattern sum, Cycles of length three and four in tournaments, Quasirandom arithmetic permutations, Quasi-randomness and the distribution of copies of a fixed graph, The quasi-randomness of hypergraph cut properties, Quasi-Random Oriented Graphs, No additional tournaments are quasirandom-forcing, On the Density of Transitive Tournaments
Cites Work
