Description: If there is a cycle of length 4 in a pseudograph, there are four (different) vertices in the graph which are mutually connected by edges. (Contributed by Alexander van der Vekens, 9-Nov-2017) (Revised by AV, 13-Feb-2021)
Ref | Expression | ||
---|---|---|---|
Hypotheses | upgr4cycl4dv4e.v | |
|
upgr4cycl4dv4e.e | |
||
Assertion | upgr4cycl4dv4e | |