Cycles and matchings in randomly perturbed digraphs and hypergraphs

DOI10.1016/j.endm.2015.06.027zbMath1346.05095arXiv1501.04816OpenAlexW2784877557MaRDI QIDQ322218

Matthew Kwan, Michael Krivelevich, Benjamin Sudakov

Publication date: 14 October 2016

Full work available at URL: https://arxiv.org/abs/1501.04816

zbMATH Keywords

hypergraphdigraphtournamentperfect matchingHamilton cyclepancyclicsmoothed analysis

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Embedding spanning bounded degree subgraphs in randomly perturbed graphs

Cites Work

• Unnamed Item
• Loose Hamilton cycles in random uniform hypergraphs
• Loose Hamilton cycles in hypergraphs
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Hamiltonian circuits in random graphs
• On smoothed analysis in dense graphs and formulas
• Factors in random graphs
• Smoothed analysis of algorithms
• Adding random edges to dense graphs
• How many random edges make a dense graph hamiltonian?
• Tight Hamilton cycles in random uniform hypergraphs
• Reducibility among Combinatorial Problems
• Some Theorems on Abstract Graphs

This page was built for publication: Cycles and matchings in randomly perturbed digraphs and hypergraphs