Saved in:
| Main Author: | Jeffries, Joel |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.08790 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Intransitive dice tournament is not quasirandom
by: Cornacchia, Elisabetta, et al.
Published: (2020)
by: Cornacchia, Elisabetta, et al.
Published: (2020)
Sidorenko property and forcing in regular tournaments
by: Král', Daniel, et al.
Published: (2026)
by: Král', Daniel, et al.
Published: (2026)
Partitioning a tournament into sub-tournaments of high connectivity
by: Girão, António, et al.
Published: (2022)
by: Girão, António, et al.
Published: (2022)
Cyclic subsets of tournaments
by: Hunter, Zach, et al.
Published: (2025)
by: Hunter, Zach, et al.
Published: (2025)
Hamilton transversals in tournaments
by: Chakraborti, Debsoumya, et al.
Published: (2023)
by: Chakraborti, Debsoumya, et al.
Published: (2023)
Trees with many leaves in tournaments
by: Benford, Alistair, et al.
Published: (2022)
by: Benford, Alistair, et al.
Published: (2022)
Transversal cycles and paths in tournaments
by: Chakraborti, Debsoumya, et al.
Published: (2024)
by: Chakraborti, Debsoumya, et al.
Published: (2024)
Variations on Sidorenko's conjecture in tournaments
by: Fox, Jacob, et al.
Published: (2024)
by: Fox, Jacob, et al.
Published: (2024)
Undecidability of polynomial inequalities in tournaments
by: Chen, Hao, et al.
Published: (2024)
by: Chen, Hao, et al.
Published: (2024)
Immersions of directed graphs in tournaments
by: Girão, António, et al.
Published: (2023)
by: Girão, António, et al.
Published: (2023)
Invertibility of digraphs and tournaments
by: Alon, Noga, et al.
Published: (2022)
by: Alon, Noga, et al.
Published: (2022)
Unavoidable structures in infinite tournaments
by: Benford, Alistair, et al.
Published: (2023)
by: Benford, Alistair, et al.
Published: (2023)
New Sidorenko-type inequalities in tournaments
by: He, Xiaoyu, et al.
Published: (2025)
by: He, Xiaoyu, et al.
Published: (2025)
Color-avoiding directed paths in tournaments
by: Fox, Jacob, et al.
Published: (2025)
by: Fox, Jacob, et al.
Published: (2025)
Blow-ups and extensions of trees in tournaments
by: Aboulker, Pierre, et al.
Published: (2024)
by: Aboulker, Pierre, et al.
Published: (2024)
The dimension of the region of feasible tournament profiles
by: Kral, Daniel, et al.
Published: (2023)
by: Kral, Daniel, et al.
Published: (2023)
Some results and problems on tournament structure
by: Nguyen, Tung, et al.
Published: (2023)
by: Nguyen, Tung, et al.
Published: (2023)
Hamilton decompositions of regular tripartite tournaments
by: Di Braccio, Francesco, et al.
Published: (2025)
by: Di Braccio, Francesco, et al.
Published: (2025)
Strong chordality in tournaments and multipartite tournaments with possible loops
by: Hell, Pavol, et al.
Published: (2025)
by: Hell, Pavol, et al.
Published: (2025)
Computing the clique number of tournaments
by: Aubian, Guillaume
Published: (2024)
by: Aubian, Guillaume
Published: (2024)
Acyclic subgraphs of tournaments with high chromatic number
by: Fox, Jacob, et al.
Published: (2019)
by: Fox, Jacob, et al.
Published: (2019)
Vertex-disjoint cycles of different lengths in tournaments
by: Bai, Yandong, et al.
Published: (2024)
by: Bai, Yandong, et al.
Published: (2024)
Finding forest-orderings of tournaments is NP-complete
by: Aboulker, Pierre, et al.
Published: (2024)
by: Aboulker, Pierre, et al.
Published: (2024)
A new perspective from hypertournaments to tournaments
by: Ai, Jiangdong, et al.
Published: (2024)
by: Ai, Jiangdong, et al.
Published: (2024)
On the number of 8-cycles for two particular regular tournaments of order N with diametrically opposite local properties
by: Savchenko, Sergey
Published: (2024)
by: Savchenko, Sergey
Published: (2024)
The probability that a random triple of dice is transitive
by: Polymath, D. H. J.
Published: (2022)
by: Polymath, D. H. J.
Published: (2022)
A Gray code for arborescences of tournaments
by: Bonamy, Marthe, et al.
Published: (2026)
by: Bonamy, Marthe, et al.
Published: (2026)
All passable games are realizable as monotone set coloring games
by: Demer, Eric, et al.
Published: (2021)
by: Demer, Eric, et al.
Published: (2021)
The structure of $Δ(1, 2, 2)$-free tournaments
by: Kim, Seokbeom, et al.
Published: (2025)
by: Kim, Seokbeom, et al.
Published: (2025)
Cutoff for the inversion walk on tournaments and the state space of restricted inversions
by: Ai, Jiangdong
Published: (2026)
by: Ai, Jiangdong
Published: (2026)
CR tournaments
by: Zeng, Jing, et al.
Published: (2025)
by: Zeng, Jing, et al.
Published: (2025)
Solution on strong partition of $2$-balanced regular multipartite tournaments
by: Ai, Jiangdong, et al.
Published: (2024)
by: Ai, Jiangdong, et al.
Published: (2024)
The geometry of random tournaments
by: Sanchez, Mario, et al.
Published: (2020)
by: Sanchez, Mario, et al.
Published: (2020)
Axiomatic and Erdős-Moon approaches to tournament rankings
by: Nokhrin, Sergei, et al.
Published: (2025)
by: Nokhrin, Sergei, et al.
Published: (2025)
Balancing games on unbounded sets
by: Bárány, Imre, et al.
Published: (2025)
by: Bárány, Imre, et al.
Published: (2025)
About the second neighborhood conjecture for tournaments missing two stars or disjoint paths
by: Daamouch, Moussa, et al.
Published: (2024)
by: Daamouch, Moussa, et al.
Published: (2024)
On 5-cycles and strong 5-subtournaments in a tournament of odd order n
by: Savchenko, Sergey
Published: (2024)
by: Savchenko, Sergey
Published: (2024)
To stay discovered: On tournament mean score sequences and the Bradley--Terry model
by: Aldous, David, et al.
Published: (2018)
by: Aldous, David, et al.
Published: (2018)
On determinants of tournaments and $\mathcal{D}_k$
by: Zeng, Jing, et al.
Published: (2024)
by: Zeng, Jing, et al.
Published: (2024)
Redicoloring some classes of circulant tournaments
by: Cordero-Michel, Narda, et al.
Published: (2025)
by: Cordero-Michel, Narda, et al.
Published: (2025)
Similar Items
-
Intransitive dice tournament is not quasirandom
by: Cornacchia, Elisabetta, et al.
Published: (2020) -
Sidorenko property and forcing in regular tournaments
by: Král', Daniel, et al.
Published: (2026) -
Partitioning a tournament into sub-tournaments of high connectivity
by: Girão, António, et al.
Published: (2022) -
Cyclic subsets of tournaments
by: Hunter, Zach, et al.
Published: (2025) -
Hamilton transversals in tournaments
by: Chakraborti, Debsoumya, et al.
Published: (2023)