2017/11/24 by Du, Junfeng, Huang, Ziwen, Xiong, Liming
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1711.08890
Let H be a class of given graphs. A graph G is said to be H-free if G contains no induced copies of H for any H ∈ H. In this article, we characterize all pairs \R,S\ of graphs such that every connected \R,S\-free graph has the same edge-connectivity and minimum degree.