Prefer a chat interface with context about you and your work?
On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs
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 notion naturally extends the idea of the local resilience of graphs recently initiated by …