On the
Figure 26, the SuperHyperNotion, namely, SuperHyperGirth, is up. There’s neither empty SuperHyperEdge nor loop SuperHyperEdge. The following extreme SuperHyperSet of extreme SuperHyperEdges[SuperHyperVertices] is the simple extreme type-SuperHyperSet of the extreme SuperHyperGirth. The extreme SuperHyperSet of extreme SuperHyperEdges[SuperHyperVertices],
is the simple extreme type-SuperHyperSet of the extreme SuperHyperGirth. The following extreme SuperHyperSet of extreme SuperHyperEdges[SuperHyperVertices] is the extreme type-SuperHyperSet of the extreme SuperHyperGirth. The extreme SuperHyperSet of extreme SuperHyperEdges[SuperHyperVertices],
Is the extreme type-SuperHyperSet of the extreme SuperHyperGirth. The extreme SuperHyperSet of the extreme SuperHyperEdges[SuperHyperVertices],
Is an
extreme SuperHyperGirth for an extreme SuperHyperGraph
is an extreme type-SuperHyperSet with
the maximum extreme cardinality of an extreme SuperHyperSet
S of extreme SuperHyperEdges[SuperHyperVertices] such that there’s only one extreme consecutive sequence of the extreme SuperHyperVertices and the extreme SuperHyperEdges form only one extreme SuperHyperCycle. There are
not only
four extreme SuperHyperVertices
inside the intended extreme SuperHyperSet. Thus the non-obvious extreme SuperHyperGirth isn’t up. The obvious simple extreme type-SuperHyperSet called the extreme SuperHyperGirth is an extreme SuperHyperSet
includes only less than
four extreme SuperHyperVertices. But the extreme SuperHyperSet of the extreme SuperHyperEdges[SuperHyperVertices],
Does has less than four SuperHyperVertices
inside the intended extreme SuperHyperSet. Thus the non-obvious simple extreme type-SuperHyperSet of the extreme SuperHyperGirth
isn’t up. To sum them up, the extreme SuperHyperSet of the extreme SuperHyperEdges[SuperHyperVertices],
Is the non-obvious simple extreme type-SuperHyperSet of the extreme SuperHyperGirth. Since the extreme SuperHyperSet of the extreme SuperHyperEdges[SuperHyperVertices],
erHyperGirth
for an extreme SuperHyperGraph
is the extreme SuperHyperSet
S of extreme SuperHyperVertices[SuperHyperEdges] such that there’s only one extreme consecutive extreme sequence of extreme SuperHyperVertices and extreme SuperHyperEdges form only one extreme SuperHyperCycle given by that extreme type-SuperHyperSet called the extreme SuperHyperGirth
and it’s an extreme
SuperHyperGirth. Since it
’sthe maximum extreme cardinality of an extreme SuperHyperSet
S of extreme SuperHyperEdges[SuperHyperVertices] such that there’s only one extreme consecutive extreme sequence of extreme SuperHyperVertices and extreme SuperHyperEdges form only one extreme SuperHyperCycle. There are only less than four extreme SuperHyperVertices
inside the intended extreme SuperHyperSet,
Thus the non-obvious extreme SuperHyperGirth,
Is up. The obvious simple extreme type-SuperHyperSet of the extreme SuperHyperGirth, is:
Does includes only less than four SuperHyperVertices in a connected extreme SuperHyperGraph It’s interesting to mention that the only simple extreme type-SuperHyperSet called the
is only and only