Cover Image

Compatible Hamilton cycles in graphs with large minimum degree

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Behague, Natalie, Di Braccio, Francesco, Granet, Bertille, Lo, Allan
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Monochromatic cycle partitions of $r$-edge-coloured graphs with high minimum degree
by: Di Braccio, Francesco, et al.
Published: (2026)

Colour-biased Hamilton cycles in dense graphs and random graphs
by: Behague, Natalie, et al.
Published: (2025)

Arbitrary orientations of Hamilton cycles in directed graphs of large minimum degree
by: DeBiasio, Louis, et al.
Published: (2025)

Leaf-to-leaf paths and cycles in degree-critical graphs
by: Di Braccio, Francesco, et al.
Published: (2025)

Hitting times in the binomial random graph
by: Granet, Bertille, et al.
Published: (2024)

Complete tripartite subgraphs of balanced tripartite graphs with large minimum degree
by: Chen, Yihan, et al.
Published: (2024)

On $2$-factors of Hamiltonian graphs
by: Díaz, Alberto Espuny, et al.
Published: (2026)

The Zarankiewicz problem on tripartite graphs
by: Di Braccio, Francesco, et al.
Published: (2024)

Powers of Hamilton cycles in oriented and directed graphs
by: DeBiasio, Louis, et al.
Published: (2024)

Hamilton cycles in random digraphs with minimum degree at least one
by: Cooper, Colin, et al.
Published: (2023)

Seymour's second neighbourhood conjecture: random graphs and reductions
by: Díaz, Alberto Espuny, et al.
Published: (2024)

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

Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree
by: Zhang, Yiran, et al.
Published: (2023)

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

Nearly all known Euclidean Ramsey sets are subsoluble
by: Behague, Natalie
Published: (2025)

An exact Ore-degree condition for Hamilton cycles in oriented graphs
by: Chang, Yulin, et al.
Published: (2025)

Total coloring graphs with large minimum degree
by: Henderschedt, Owen, et al.
Published: (2025)

On the existence of minimally tough graphs having large minimum degrees
by: Hasanvand, Morteza
Published: (2025)

A strengthening on consecutive odd cycles in graphs of given minimum degree
by: Lin, Hao, et al.
Published: (2024)

Odd and even cycle lengths, minimum degree and chromatic number in graphs
by: Wang, Xiaolin
Published: (2025)

A note on inverting the dijoin of oriented graphs
by: Behague, Natalie, et al.
Published: (2024)

Anticoncentration of random spanning trees in graphs with large minimum degree
by: Bitonti, Veronica, et al.
Published: (2026)

A case of the dijoin conjecture on inverting oriented graphs
by: Behague, Natalie, et al.
Published: (2025)

Exact minimum co-degree conditions for $\ell$-Hamiltonicity in hypergraphs
by: Gan, Luyining, et al.
Published: (2026)

Leaf-to-leaf paths of many lengths
by: Di Braccio, Francesco, et al.
Published: (2025)

The semi-inducibility problem
by: Basit, Abdul, et al.
Published: (2025)

Almost partitioning every $2$-edge-coloured complete $k$-graph into $k$ monochromatic tight cycles
by: Lo, Allan, et al.
Published: (2023)

Exact supported co-degree bounds for Hamilton cycles
by: Letzter, Shoham, et al.
Published: (2025)

The Hamilton cycle space of random graphs
by: Hefetz, Dan, et al.
Published: (2025)

Colorful Hamilton cycles in random graphs
by: Chakraborti, Debsoumya, et al.
Published: (2021)

The minimum size of a chordal graph with given order and minimum degree
by: Zhan, Xingzhi, et al.
Published: (2024)

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

Creating Subgraphs in Semi-Random Hypergraph Games
by: Behague, Natalie, et al.
Published: (2024)

Sabotage the Mantel Theorem
by: Behague, Natalie, et al.
Published: (2025)

Forbidden subgraphs generating a finite set of graphs with minimum degree three and large girth
by: Egawa, Yoshimi, et al.
Published: (2024)

Hitting time for Hamilton cycles in pseudorandom graphs
by: Chen, Yaobin, et al.
Published: (2026)

Tight bound on the minimum degree to guarantee graphs forbidding some odd cycles to be bipartite
by: Yuan, Xiaoli, et al.
Published: (2023)

Near rainbow Hamilton cycles in dense graphs
by: Peng, Danni, et al.
Published: (2024)

Building graphs with high minimum degree on a budget
by: Katsamaktsis, Kyriakos, et al.
Published: (2024)

Bipartite graphs with minimum degree at least 15 are antimagic
by: Deng, Kecai
Published: (2025)