论文信息 - Local resilience of graphs

Local resilience of graphs

In this paper, we initiate a systematic study of graph resilience. The (local) resilience of a graph G with respect to a property P measures how much one has to change G (locally) in order to destroy P. Estimating the resilience leads to many new and challenging problems. Here we focus on random and pseudo-random graphs and prove several sharp results.

Benny Sudakov | Van H. Vu | B. Sudakov | V. Vu

[1] B. Bollobás,et al. An algorithm for finding hamilton paths and cycles in random graphs , 1987 .

[2] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[3] P. Erdös. ASYMMETRIC GRAPHS , 2022 .

[4] Frank Harary,et al. Graph Theory , 2016 .

[5] L. Pósa,et al. Hamiltonian circuits in random graphs , 1976, Discret. Math..

[6] L. Lovász. Combinatorial problems and exercises , 1979 .

[7] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.

[8] Benny Sudakov,et al. Sparse pseudo-random graphs are Hamiltonian , 2003, J. Graph Theory.

[9] A. RÉNY,et al. ON THE EXISTENCE OF A FACTOR OF DEGREE ONE OF A CONNECTED RANDOM GRAPH , 2004 .

[10] V. Vu,et al. Sandwiching random graphs , 2002 .

[11] Benny Sudakov,et al. On the probability of independent sets in random graphs , 2003, Random Struct. Algorithms.

[12] Béla Bollobás,et al. The chromatic number of random graphs , 1988, Comb..

[13] P. Erdos,et al. On the existence of a factor of degree one of a connected random graph , 1966 .