Add to ORKGWe prove that every $n$-vertex tournament has at most $n\left(\frac{n-1}{2}\right)^k$ walks of length $k$.Comment: Appendix with alternative entropy proof by Dingding Dong and Tomasz \'Slusarczy
AbstractA family P of simple (that is, cycle-free) paths is a path decomposition of a tournament T i...
We use a variant of Bukh's random algebraic method to show that for every natural number k ≥ 2 there...
AbstractWe prove that with three exceptions, every tournament of order n contains each oriented path...
International audienceIn this short note we prove that every tournament contains the k -th power of ...
We prove that every \(n\)-vertex tournament has at most \(n \left(\frac{n-1}{2} \right)^k\) walks of...
In this work we consider a generalisation of Kelly's conjecture which is due Alspach, Mason, and Pul...
We study the asymptotic behavior of the maximum number of directed cycles of a given length in a tou...
We prove that there exists $C>0$ such that any $(n+Ck)$-vertex tournament contains a copy of every $...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite or c-parti...
AbstractWe prove that a tournament with n vertices has more than 0.13n2(1+o(1)) edge-disjoint transi...
We prove that, with high probability, any 2‐edge‐coloring of a random tournament on n vertices conta...
We consider how large a tournament must be in order to guarantee the appearance of a given oriented ...
AbstractA king in a tournament is a vertex which can reach every other vertex via a 1-path or 2-path...
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tourname...
AbstractFor any tournament T on n vertices, let h(T) denote the maximum number of edges in the inter...
AbstractA family P of simple (that is, cycle-free) paths is a path decomposition of a tournament T i...
We use a variant of Bukh's random algebraic method to show that for every natural number k ≥ 2 there...
AbstractWe prove that with three exceptions, every tournament of order n contains each oriented path...
International audienceIn this short note we prove that every tournament contains the k -th power of ...
We prove that every \(n\)-vertex tournament has at most \(n \left(\frac{n-1}{2} \right)^k\) walks of...
In this work we consider a generalisation of Kelly's conjecture which is due Alspach, Mason, and Pul...
We study the asymptotic behavior of the maximum number of directed cycles of a given length in a tou...
We prove that there exists $C>0$ such that any $(n+Ck)$-vertex tournament contains a copy of every $...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite or c-parti...
AbstractWe prove that a tournament with n vertices has more than 0.13n2(1+o(1)) edge-disjoint transi...
We prove that, with high probability, any 2‐edge‐coloring of a random tournament on n vertices conta...
We consider how large a tournament must be in order to guarantee the appearance of a given oriented ...
AbstractA king in a tournament is a vertex which can reach every other vertex via a 1-path or 2-path...
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tourname...
AbstractFor any tournament T on n vertices, let h(T) denote the maximum number of edges in the inter...
AbstractA family P of simple (that is, cycle-free) paths is a path decomposition of a tournament T i...
We use a variant of Bukh's random algebraic method to show that for every natural number k ≥ 2 there...
AbstractWe prove that with three exceptions, every tournament of order n contains each oriented path...