A degree and forbidden subgraph condition for a k-contractible edge

An edge in a k-conected graph is said to be k-contractible if the contraction of it results in a k-connected graph. We say that k-connected graph G satis es “ degree-sum conditon ”if Σx2V (W)degG(x) 3k +2 holds for any connected subgraph W of G with 　｜W｜= 3. Let k be an integer such that k 5. We prove that if a k-connected graph with no K1+C4 satis es degree-sum condition, then it has a k-contractible edge.電気通信大学201

This Week's Finds in Mathematical Physics (1-50)

These are the first 50 issues of This Week's Finds of Mathematical Physics, from January 19, 1993 to March 12, 1995. These issues focus on quantum gravity, topological quantum field theory, knot theory, and applications of $n$-categories to these subjects. However, there are also digressions into Lie algebras, elliptic curves, linear logic and other subjects. They were typeset in 2020 by Tim Hosgood. If you see typos or other problems please report them. (I already know the cover page looks weird).Comment: 242 page