Cover Image

Vertex-disjoint cycles of different lengths in tournaments

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bai, Yandong, Jia, Wenpei
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On graphs without cycles of length 1 modulo 3
by: Bai, Yandong, et al.
Published: (2025)

On 2-connected graphs without cycles of length 1 modulo 3
by: Bai, Yandong, et al.
Published: (2026)

About the second neighborhood conjecture for tournaments missing two stars or disjoint paths
by: Daamouch, Moussa, et al.
Published: (2024)

Transversal cycles and paths in tournaments
by: Chakraborti, Debsoumya, et al.
Published: (2024)

Cycle lengths in graphs of given minimum degree
by: Bai, Yandong, et al.
Published: (2025)

Edge-disjoint cycles with the same vertex set
by: Chakraborti, Debsoumya, et al.
Published: (2024)

An improved integrality gap for disjoint cycles in planar graphs
by: Schlomberg, Niklas
Published: (2024)

Arc-disjoint Steiner Cycles in Digraphs
by: Bai, Jie, et al.
Published: (2026)

Bounds on treewidth via excluding disjoint unions of cycles
by: Hatzel, Meike, et al.
Published: (2025)

Two-disjoint-cycle-cover vertex pancyclicity of split-star networks
by: Liu, Chang, et al.
Published: (2026)

Edge disjoint Hamilton cycles in random digraphs of constant minimum degree
by: Cooper, Colin, et al.
Published: (2026)

On 5-cycles and strong 5-subtournaments in a tournament of odd order n
by: Savchenko, Sergey
Published: (2024)

Partitioning a tournament into sub-tournaments of high connectivity
by: Girão, António, et al.
Published: (2022)

Cross-intersecting families with covering number constraints
by: Bai, Yandong, et al.
Published: (2026)

Signless Laplacian characterization of cones over disjoint unions of cycles, edges and isolated vertices
by: Ye, Jiachang, et al.
Published: (2025)

A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cycles
by: Zhang, Jie, 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)

Eigenvalues and cycles of consecutive lengths
by: Li, Binlong, et al.
Published: (2021)

On the number of 8-cycles for two particular regular tournaments of order N with diametrically opposite local properties
by: Savchenko, Sergey
Published: (2024)

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
by: Joret, Gwenaël, et al.
Published: (2026)

Variations on Sidorenko's conjecture in tournaments
by: Fox, Jacob, et al.
Published: (2024)

Undecidability of polynomial inequalities in tournaments
by: Chen, Hao, et al.
Published: (2024)

Trees with many leaves in tournaments
by: Benford, Alistair, et al.
Published: (2022)

Immersions of directed graphs in tournaments
by: Girão, António, et al.
Published: (2023)

Blow-ups and extensions of trees in tournaments
by: Aboulker, Pierre, et al.
Published: (2024)

Invertibility of digraphs and tournaments
by: Alon, Noga, et al.
Published: (2022)

New Sidorenko-type inequalities in tournaments
by: He, Xiaoyu, et al.
Published: (2025)

Color-avoiding directed paths in tournaments
by: Fox, Jacob, et al.
Published: (2025)

The dimension of the region of feasible tournament profiles
by: Kral, Daniel, et al.
Published: (2023)

Some results and problems on tournament structure
by: Nguyen, Tung, et al.
Published: (2023)

Hamilton decompositions of regular tripartite tournaments
by: Di Braccio, Francesco, et al.
Published: (2025)

Sidorenko property and forcing in regular tournaments
by: Král', Daniel, et al.
Published: (2026)

Intransitive dice tournament is not quasirandom
by: Cornacchia, Elisabetta, et al.
Published: (2020)

Unavoidable structures in infinite tournaments
by: Benford, Alistair, et al.
Published: (2023)

Tournament completions of bipartite tournaments and their augmented directed cycles
by: Wong, H. W. Willie
Published: (2024)

Existence of cycles of length divisible by 3 or 4
by: Choi, Ilkyoo, et al.
Published: (2026)

Packing edge disjoint cliques in graphs
by: Balogh, József, et al.
Published: (2025)

Edge-disjoint linkage in infinite graphs
by: Assem, Amena, et al.
Published: (2025)

Extremal results on Berge disjoint paths
by: Zhao, Xiamiao, et al.
Published: (2025)