There is a graph G with a variable k.
The following is the graph G when k=3.
There are three vertice on each green circle line, and each of (1,2,3) is assigned to each of the green line.The graph has a property such that if the edge labeled with i is cut, another edge labeled with i is also cut.
When k is an arbitrary number, in the graph G there are k vertice on each green circle line, and each of (1,2,...k) is assigned to each of the green line. Each point on the upper circle is edge-connected by red edges with every points on the lower circle like the graph G when k=3.
Is this graph (k+1)-edge-connected?