Random regular tournaments
From MaRDI portal
Cites work
Cited in
(7)- A random walk approach to linear statistics in random tournament ensembles
- Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension
- On the minimum number of inversions to make a digraph k-(arc-)strong
- Random walks on Coxeter interchange graphs
- The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
- Induced subgraphs of Ramsey graphs with many distinct degrees
This page was built for publication: Random regular tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1844238)