Cycles and matchings in randomly perturbed digraphs and hypergraphs

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

Michael Krivelevich, Matthew Kwan, Benjamin Sudakov

Publication date: 14 October 2016

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

zbMATH Keywords

hypergraph; digraph; tournament; perfect matching; Hamilton cycle; pancyclic; smoothed analysis

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C65: Hypergraphs

05C38: Paths and cycles

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C20: Directed graphs (digraphs), tournaments

05C45: Eulerian and Hamiltonian graphs