Cover Image

How many random edges make an almost-Dirac graph Hamiltonian?

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Díaz, Alberto Espuny, Razafindravola, Richarlotte Valérà
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 $2$-factors of Hamiltonian graphs
by: Díaz, Alberto Espuny, et al.
Published: (2026)

On the local resilience of random geometric graphs with respect to connectivity and long cycles
by: Díaz, Alberto Espuny, et al.
Published: (2024)

Dirac's theorem for graphs of bounded bandwidth
by: Díaz, Alberto Espuny, et al.
Published: (2024)

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

On constructing small subgraphs in the budget-constrained random graph process
by: Antoniuk, Sylwia, et al.
Published: (2026)

Graph factors and powers of Hamilton cycles in the budget-constrained random graph process
by: Díaz, Alberto Espuny, et al.
Published: (2025)

Speeding up random walk mixing by starting from a uniform vertex
by: Díaz, Alberto Espuny, et al.
Published: (2022)

Anticoncentration of random spanning trees in almost regular graphs
by: Lee, Hyunwoo
Published: (2026)

Monochromatic components with many edges in random graphs
by: Fox, Hannah, et al.
Published: (2025)

Cycles with almost linearly many chords
by: Draganić, Nemanja, et al.
Published: (2026)

Pancyclicity of almost-planar graphs
by: Adams, Santiago T., et al.
Published: (2024)

Random walks on edge colored random graphs
by: Cooper, Colin, et al.
Published: (2024)

On extremal (almost) edge-girth-regular graphs
by: Araujo-Pardo, Gabriela, et al.
Published: (2024)

Powers of Hamiltonian cycles in randomly augmented Pósa-Seymour graphs
by: Antoniuk, Sylwia, et al.
Published: (2025)

On almost Gallai colourings in complete graphs
by: Grebennikov, Alexandr, et al.
Published: (2025)

Sparse random graphs with many triangles
by: Chakraborty, Suman, et al.
Published: (2021)

A local limit theorem for the edge counts of random induced subgraphs of a random graph
by: Balister, Paul, et al.
Published: (2025)

Coloring graphs with forbidden almost bipartite subgraphs
by: Anderson, James, et al.
Published: (2022)

On $t$-edge-balanced graphs
by: Chee, Yeow Meng
Published: (2026)

How to get the random graph with non-uniform probabilities?
by: Coregliano, Leonardo N., et al.
Published: (2024)

Kneser graphs are Hamiltonian
by: Merino, Arturo, et al.
Published: (2022)

Saturation of edge-ordered graphs
by: Bošković, Vladimir, et al.
Published: (2024)

$t$-tone edge coloring of graphs
by: Bazzal, Hadeel Al
Published: (2026)

Exponential odd-distance sets under the Manhattan metric
by: Díaz, Alberto Espuny, et al.
Published: (2024)

On R-disjoint graphs: a generalization of almost bipartite non-König-Egerváry graphs
by: Pereyra, Kevin
Published: (2026)

Robust Hamiltonicity in families of Dirac graphs
by: Anastos, Michael, et al.
Published: (2023)

Subgraphs in random graphs with specified degrees and forbidden edges
by: Larkin, John, et al.
Published: (2025)

The effect of adding randomly weighted edges
by: Frieze, Alan
Published: (2020)

On the $Δ$-edge stability number of graphs
by: Akbari, Saieed, et al.
Published: (2024)

Semistrong edge colorings of planar graphs
by: Lin, Yuquan, et al.
Published: (2024)

Monitoring edge-geodetic sets in graphs
by: Dev, Subhadeep R., et al.
Published: (2022)

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

On the number of edges of restricted matchstick graphs
by: Gehér, Panna, et al.
Published: (2025)

Vertex-distinguishing edge coloring of graphs
by: Gao, Yuping, et al.
Published: (2025)

Rainbow matchings in edge-colored graphs
by: Lu, Hongliang, et al.
Published: (2025)

Packing tetrahedrons in edge-weighted graphs
by: Sun, Wanting, et al.
Published: (2025)

Orientations of graphs omitting non-edge-critical directed graphs
by: Sheats, Hannah
Published: (2025)

Tree-alpha and excluding finitely many graphs
by: Hajebi, Sepehr, et al.
Published: (2026)

Perfect matchings in random sparsifications of Dirac hypergraphs
by: Kang, Dong Yeap, et al.
Published: (2022)

Dirac-type condition for Hamilton-generated graphs
by: Hou, Xinmin, et al.
Published: (2025)