No additional tournaments are quasirandom-forcing

12/09/2019
by   Robert Hancock, et al.
0

A tournament H is quasirandom-forcing if the following holds for every sequence (G_n) of tournaments of growing orders: if the density of H in G_n converges to the expected density of H in a random tournament, then (G_n) is quasirandom. Every transitive tournament with at least 4 vertices is quasirandom-forcing, and Coregliano et al. [Electron. J. Combin. 26 (2019), P1.44] showed that there is also a non-transitive 5-vertex tournament with the property. We show that no additional tournament has this property.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/12/2020

An Optimal Decentralized (Δ+ 1)-Coloring Algorithm

Consider the following simple coloring algorithm for a graph on n vertic...
research
12/14/2021

Secretary Matching With Vertex Arrivals and No Rejections

Most prior work on online matching problems has been with the flexibilit...
research
04/19/2023

A note on the connectedness property of union-free generic sets of partial orders

This short note describes and proves a connectedness property which was ...
research
10/23/2021

Symmetric properties and two variants of shuffle-cubes

Li et al. in [Inf. Process. Lett. 77 (2001) 35–41] proposed the shuffle ...
research
04/17/2019

A Brief Note on Single Source Fault Tolerant Reachability

Let G be a directed graph with n vertices and m edges, and let s ∈ V(G) ...
research
07/12/2021

Weakened Random Oracle Models with Target Prefix

Weakened random oracle models (WROMs) are variants of the random oracle ...
research
04/01/2021

Hereditary rigidity, separation and density In memory of Professor I.G. Rosenberg

We continue the investigation of systems of hereditarily rigid relations...

Please sign up or login with your details

Forgot password? Click here to reset