Description: If a hypergraph has two vertices, and there is an edge between the vertices, then each vertex is the neighbor of the other vertex. (Contributed by AV, 2-Nov-2020) (Proof shortened by AV, 13-Feb-2022)
Ref | Expression | ||
---|---|---|---|
Hypotheses | nbgr2vtx1edg.v | |
|
nbgr2vtx1edg.e | |
||
Assertion | nbuhgr2vtx1edgb | |