Trees with many leaves in tournaments
Fuente:
arXiv
Guardado en:
| Autores principales: | Benford, Alistair, Montgomery, Richard |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Unavoidable structures in infinite tournaments
por: Benford, Alistair, et al.
Publicado: (2023)
por: Benford, Alistair, et al.
Publicado: (2023)
Partitioning a tournament into sub-tournaments of high connectivity
por: Girão, António, et al.
Publicado: (2022)
por: Girão, António, et al.
Publicado: (2022)
Transversals in Latin Squares
por: Montgomery, Richard
Publicado: (2024)
por: Montgomery, Richard
Publicado: (2024)
Cyclic subsets of tournaments
por: Hunter, Zach, et al.
Publicado: (2025)
por: Hunter, Zach, et al.
Publicado: (2025)
Hamilton transversals in tournaments
por: Chakraborti, Debsoumya, et al.
Publicado: (2023)
por: Chakraborti, Debsoumya, et al.
Publicado: (2023)
Transversal cycles and paths in tournaments
por: Chakraborti, Debsoumya, et al.
Publicado: (2024)
por: Chakraborti, Debsoumya, et al.
Publicado: (2024)
Variations on Sidorenko's conjecture in tournaments
por: Fox, Jacob, et al.
Publicado: (2024)
por: Fox, Jacob, et al.
Publicado: (2024)
Undecidability of polynomial inequalities in tournaments
por: Chen, Hao, et al.
Publicado: (2024)
por: Chen, Hao, et al.
Publicado: (2024)
Immersions of directed graphs in tournaments
por: Girão, António, et al.
Publicado: (2023)
por: Girão, António, et al.
Publicado: (2023)
Invertibility of digraphs and tournaments
por: Alon, Noga, et al.
Publicado: (2022)
por: Alon, Noga, et al.
Publicado: (2022)
New Sidorenko-type inequalities in tournaments
por: He, Xiaoyu, et al.
Publicado: (2025)
por: He, Xiaoyu, et al.
Publicado: (2025)
Color-avoiding directed paths in tournaments
por: Fox, Jacob, et al.
Publicado: (2025)
por: Fox, Jacob, et al.
Publicado: (2025)
Blow-ups and extensions of trees in tournaments
por: Aboulker, Pierre, et al.
Publicado: (2024)
por: Aboulker, Pierre, et al.
Publicado: (2024)
The dimension of the region of feasible tournament profiles
por: Kral, Daniel, et al.
Publicado: (2023)
por: Kral, Daniel, et al.
Publicado: (2023)
Some results and problems on tournament structure
por: Nguyen, Tung, et al.
Publicado: (2023)
por: Nguyen, Tung, et al.
Publicado: (2023)
Hamilton decompositions of regular tripartite tournaments
por: Di Braccio, Francesco, et al.
Publicado: (2025)
por: Di Braccio, Francesco, et al.
Publicado: (2025)
Sidorenko property and forcing in regular tournaments
por: Král', Daniel, et al.
Publicado: (2026)
por: Král', Daniel, et al.
Publicado: (2026)
Intransitive dice tournament is not quasirandom
por: Cornacchia, Elisabetta, et al.
Publicado: (2020)
por: Cornacchia, Elisabetta, et al.
Publicado: (2020)
Almost every Latin square has a decomposition into transversals
por: Bowtell, Candida, et al.
Publicado: (2025)
por: Bowtell, Candida, et al.
Publicado: (2025)
Asymptotically-tight packing and covering with transversal bases in Rota's basis conjecture
por: Montgomery, Richard, et al.
Publicado: (2025)
por: Montgomery, Richard, et al.
Publicado: (2025)
Packing the largest trees in the tree packing conjecture
por: Janzer, Barnabás, et al.
Publicado: (2024)
por: Janzer, Barnabás, et al.
Publicado: (2024)
Acyclic subgraphs of tournaments with high chromatic number
por: Fox, Jacob, et al.
Publicado: (2019)
por: Fox, Jacob, et al.
Publicado: (2019)
Vertex-disjoint cycles of different lengths in tournaments
por: Bai, Yandong, et al.
Publicado: (2024)
por: Bai, Yandong, et al.
Publicado: (2024)
Finding forest-orderings of tournaments is NP-complete
por: Aboulker, Pierre, et al.
Publicado: (2024)
por: Aboulker, Pierre, et al.
Publicado: (2024)
A new perspective from hypertournaments to tournaments
por: Ai, Jiangdong, et al.
Publicado: (2024)
por: Ai, Jiangdong, et al.
Publicado: (2024)
Computing the clique number of tournaments
por: Aubian, Guillaume
Publicado: (2024)
por: Aubian, Guillaume
Publicado: (2024)
Strong chordality in tournaments and multipartite tournaments with possible loops
por: Hell, Pavol, et al.
Publicado: (2025)
por: Hell, Pavol, et al.
Publicado: (2025)
Counting spanning subgraphs in dense hypergraphs
por: Montgomery, Richard, et al.
Publicado: (2023)
por: Montgomery, Richard, et al.
Publicado: (2023)
Schuttes property for sets of tournaments and an application to dice games
por: Jeffries, Joel
Publicado: (2026)
por: Jeffries, Joel
Publicado: (2026)
The structure of $Δ(1, 2, 2)$-free tournaments
por: Kim, Seokbeom, et al.
Publicado: (2025)
por: Kim, Seokbeom, et al.
Publicado: (2025)
A Gray code for arborescences of tournaments
por: Bonamy, Marthe, et al.
Publicado: (2026)
por: Bonamy, Marthe, et al.
Publicado: (2026)
Spanning trees for many different numbers of leaves
por: Noguchi, Kenta, et al.
Publicado: (2023)
por: Noguchi, Kenta, et al.
Publicado: (2023)
Solution on strong partition of $2$-balanced regular multipartite tournaments
por: Ai, Jiangdong, et al.
Publicado: (2024)
por: Ai, Jiangdong, et al.
Publicado: (2024)
Cutoff for the inversion walk on tournaments and the state space of restricted inversions
por: Ai, Jiangdong
Publicado: (2026)
por: Ai, Jiangdong
Publicado: (2026)
A proof of the Kim-Vu sandwich conjecture
por: Behague, Natalie, et al.
Publicado: (2025)
por: Behague, Natalie, et al.
Publicado: (2025)
Ramsey numbers of bounded degree trees versus general graphs
por: Montgomery, Richard, et al.
Publicado: (2023)
por: Montgomery, Richard, et al.
Publicado: (2023)
About the second neighborhood conjecture for tournaments missing two stars or disjoint paths
por: Daamouch, Moussa, et al.
Publicado: (2024)
por: Daamouch, Moussa, et al.
Publicado: (2024)
On 5-cycles and strong 5-subtournaments in a tournament of odd order n
por: Savchenko, Sergey
Publicado: (2024)
por: Savchenko, Sergey
Publicado: (2024)
Axiomatic and Erdős-Moon approaches to tournament rankings
por: Nokhrin, Sergei, et al.
Publicado: (2025)
por: Nokhrin, Sergei, et al.
Publicado: (2025)
The geometry of random tournaments
por: Sanchez, Mario, et al.
Publicado: (2020)
por: Sanchez, Mario, et al.
Publicado: (2020)
Ejemplares similares
-
Unavoidable structures in infinite tournaments
por: Benford, Alistair, et al.
Publicado: (2023) -
Partitioning a tournament into sub-tournaments of high connectivity
por: Girão, António, et al.
Publicado: (2022) -
Transversals in Latin Squares
por: Montgomery, Richard
Publicado: (2024) -
Cyclic subsets of tournaments
por: Hunter, Zach, et al.
Publicado: (2025) -
Hamilton transversals in tournaments
por: Chakraborti, Debsoumya, et al.
Publicado: (2023)