(H,k) stable bipartite graphs with the minimum size

Abstract

Let us call a graph G (H ; k) vertex stable if it contains a subgraph H after removing any of its k vertices. In this paper we are interested in finding the (Kn,n+1; 1) (respectively (Kn,n; 1)) vertex stable graphs with minimum size.