A note on the disconnection number (Q616931)

A continuum \(X\) is called a graph if there exist finitely many arcs in \(X\) which cover \(X\) and any two of these distinct arcs intersect (at most) in their set of endpoints. The disconnection number of a graph \(X\) is the minimal cardinal \(n\) such that whenever \(A\subseteq X\) has cardinality \(n\), then \(X\setminus A\) is disconnected. The only continuum with disconnection number 2 is a simple closed curve and it is known that there are five graphs (an arc, an 8, a 9, a \(\theta\) and a dumbbell) with disconnection number 3. This paper gives a simple way of calculating all graphs with disconnection number \(n+1\) if the graphs with disconnection number \(n\) are known. Moreover, each graph with disconnection number \(n+1\) can be obtained from a graph with disconnection number \(n\) by means of one of four simple operations. Confirming a conjecture of S. Nadler, this method is used to show that there are precisely 26 graphs with disconnection number 4. Upper and lower bounds for the number of graphs with disconnection number \(n\) are also obtained.