Image de couverture de livre

Monochromatic cycle partitions of $r$-edge-coloured graphs with high minimum degree

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Di Braccio, Francesco, Patel, Viresh
Format:	Preprint
Publié:	2026
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Compatible Hamilton cycles in graphs with large minimum degree
par: Behague, Natalie, et autres
Publié: (2026)

Monochromatic partitions in 2-edge-coloured bipartite graphs
par: Fernández, Camila, et autres
Publié: (2024)

Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree
par: Zhang, Yiran, et autres
Publié: (2023)

Monochromatic odd cycles in edge-coloured complete graphs
par: Girão, António, et autres
Publié: (2024)

Leaf-to-leaf paths and cycles in degree-critical graphs
par: Di Braccio, Francesco, et autres
Publié: (2025)

Hamilton decompositions of regular tripartite tournaments
par: Di Braccio, Francesco, et autres
Publié: (2025)

Partitioning a 2-edge-coloured graph of minimum degree $2n/3 + o(n)$ into three monochromatic cycles
par: Allen, Peter, et autres
Publié: (2022)

The Zarankiewicz problem on tripartite graphs
par: Di Braccio, Francesco, et autres
Publié: (2024)

Almost partitioning every $2$-edge-coloured complete $k$-graph into $k$ monochromatic tight cycles
par: Lo, Allan, et autres
Publié: (2023)

Path decompositions of oriented graphs
par: Patel, Viresh, et autres
Publié: (2024)

A parameterized algorithm for $K_r$-factors in graphs of high minimum degree
par: Gan, Luyining, et autres
Publié: (2023)

Polynomial bounds for monochromatic tight cycle partition in $r$-edge-coloured $K_n^{(k)}$
par: Bandyopadhyay, Debmalya, et autres
Publié: (2024)

Building graphs with high minimum degree on a budget
par: Katsamaktsis, Kyriakos, et autres
Publié: (2024)

A strengthening on consecutive odd cycles in graphs of given minimum degree
par: Lin, Hao, et autres
Publié: (2024)

Odd and even cycle lengths, minimum degree and chromatic number in graphs
par: Wang, Xiaolin
Publié: (2025)

Arbitrary orientations of Hamilton cycles in directed graphs of large minimum degree
par: DeBiasio, Louis, et autres
Publié: (2025)

Leaf-to-leaf paths of many lengths
par: Di Braccio, Francesco, et autres
Publié: (2025)

Zero-free regions for the independence polynomial on restricted graph classes
par: Jerrum, Mark, et autres
Publié: (2025)

The minimum size of a chordal graph with given order and minimum degree
par: Zhan, Xingzhi, et autres
Publié: (2024)

Cycle lengths in graphs of given minimum degree
par: Bai, Yandong, et autres
Publié: (2025)

Monochromatic $k$-connection of graphs
par: Cai, Qingqiong, et autres
Publié: (2024)

Hamilton cycles in random digraphs with minimum degree at least one
par: Cooper, Colin, et autres
Publié: (2023)

Tight bound on the minimum degree to guarantee graphs forbidding some odd cycles to be bipartite
par: Yuan, Xiaoli, et autres
Publié: (2023)

Bipartite graphs with minimum degree at least 15 are antimagic
par: Deng, Kecai
Publié: (2025)

The minimum edge-pancyclic graph of a given order
par: Zhao, Xiamiao, et autres
Publié: (2025)

On the expressive power of $2$-edge-colourings of graphs
par: Bok, Jan, et autres
Publié: (2025)

Edge disjoint Hamilton cycles in random digraphs of constant minimum degree
par: Cooper, Colin, et autres
Publié: (2026)

Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs
par: Krone, Maximilian
Publié: (2025)

Sums along the edges of bounded degree graphs
par: Alon, Noga, et autres
Publié: (2025)

The circumference of a graph with given minimum degree and clique number
par: Chen, Na, et autres
Publié: (2025)

Improved bounds for the minimum degree of minimal multicolor Ramsey graphs
par: Attwa, Yamaan, et autres
Publié: (2025)

On the existence of minimally tough graphs having large minimum degrees
par: Hasanvand, Morteza
Publié: (2025)

Paired domination in graphs with minimum degree four
par: Bujtás, Csilla, et autres
Publié: (2025)

Total coloring graphs with large minimum degree
par: Henderschedt, Owen, et autres
Publié: (2025)

On the isolation number of graphs with minimum degree four
par: Goddard, Wayne, et autres
Publié: (2025)

Orientations of cycles in digraphs of high chromatic number and high minimum out-degree
par: Koerts, Hidde, et autres
Publié: (2025)

Monochromatic components with many edges in random graphs
par: Fox, Hannah, et autres
Publié: (2025)

Anticoncentration of random spanning trees in graphs with large minimum degree
par: Bitonti, Veronica, et autres
Publié: (2026)

Complete tripartite subgraphs of balanced tripartite graphs with large minimum degree
par: Chen, Yihan, et autres
Publié: (2024)

Injective edge-coloring of graphs with small maximum degree
par: Huang, Danjun, et autres
Publié: (2025)