On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs
Work
Year: 2011
Type: article
Abstract: Let be a sequence of integers. For an increasing monotone graph property we say that a base graph is -resilient with respect to if for every subgraph such that for every the graph possesses . This not... more
Institutions Tel Aviv University, UCLA Health
Cites: 27
Cited by: 65
Related to: 10
FWCI: 8.752
Citation percentile (by year/subfield): 95.44
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green