Saved in:
| Main Authors: | Benford, Alistair, Montgomery, Richard |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2207.06384 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Unavoidable structures in infinite tournaments
by: Benford, Alistair, et al.
Published: (2023)
by: Benford, Alistair, et al.
Published: (2023)
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)
Transversals in Latin Squares
by: Montgomery, Richard
Published: (2024)
by: Montgomery, Richard
Published: (2024)
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)
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)
Intransitive dice tournament is not quasirandom
by: Cornacchia, Elisabetta, et al.
Published: (2020)
by: Cornacchia, Elisabetta, et al.
Published: (2020)
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)
Sidorenko property and forcing in regular tournaments
by: Král', Daniel, et al.
Published: (2026)
by: Král', Daniel, et al.
Published: (2026)
Almost every Latin square has a decomposition into transversals
by: Bowtell, Candida, et al.
Published: (2025)
by: Bowtell, Candida, et al.
Published: (2025)
Asymptotically-tight packing and covering with transversal bases in Rota's basis conjecture
by: Montgomery, Richard, et al.
Published: (2025)
by: Montgomery, Richard, et al.
Published: (2025)
Packing the largest trees in the tree packing conjecture
by: Janzer, Barnabás, et al.
Published: (2024)
by: Janzer, Barnabás, et al.
Published: (2024)
Strong chordality in tournaments and multipartite tournaments with possible loops
by: Hell, Pavol, et al.
Published: (2025)
by: Hell, Pavol, et al.
Published: (2025)
Spanning trees for many different numbers of leaves
by: Noguchi, Kenta, et al.
Published: (2023)
by: Noguchi, Kenta, et al.
Published: (2023)
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)
Counting spanning subgraphs in dense hypergraphs
by: Montgomery, Richard, et al.
Published: (2023)
by: Montgomery, Richard, et al.
Published: (2023)
A Gray code for arborescences of tournaments
by: Bonamy, Marthe, et al.
Published: (2026)
by: Bonamy, Marthe, et al.
Published: (2026)
Schuttes property for sets of tournaments and an application to dice games
by: Jeffries, Joel
Published: (2026)
by: Jeffries, Joel
Published: (2026)
The structure of $Δ(1, 2, 2)$-free tournaments
by: Kim, Seokbeom, et al.
Published: (2025)
by: Kim, Seokbeom, et al.
Published: (2025)
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)
Cutoff for the inversion walk on tournaments and the state space of restricted inversions
by: Ai, Jiangdong
Published: (2026)
by: Ai, Jiangdong
Published: (2026)
The geometry of random tournaments
by: Sanchez, Mario, et al.
Published: (2020)
by: Sanchez, Mario, et al.
Published: (2020)
A proof of the Kim-Vu sandwich conjecture
by: Behague, Natalie, et al.
Published: (2025)
by: Behague, Natalie, et al.
Published: (2025)
Ramsey numbers of bounded degree trees versus general graphs
by: Montgomery, Richard, et al.
Published: (2023)
by: Montgomery, Richard, et al.
Published: (2023)
Axiomatic and Erdős-Moon approaches to tournament rankings
by: Nokhrin, Sergei, et al.
Published: (2025)
by: Nokhrin, Sergei, 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)
Similar Items
-
Unavoidable structures in infinite tournaments
by: Benford, Alistair, et al.
Published: (2023) -
Partitioning a tournament into sub-tournaments of high connectivity
by: Girão, António, et al.
Published: (2022) -
Transversals in Latin Squares
by: Montgomery, Richard
Published: (2024) -
Cyclic subsets of tournaments
by: Hunter, Zach, et al.
Published: (2025) -
Hamilton transversals in tournaments
by: Chakraborti, Debsoumya, et al.
Published: (2023)