A simplified version of strong connectivity in geometries (Q791157): Difference between revisions

In the theory of diagram geometries, the axiom of the strong connectivity is shown to be equivalent to the apparently weaker axiom: (C) The geometry \(\Gamma =(S,I,t)\) over \(\Delta\) has property (C) if \((S<I)\) is a connected graph and if the same holds for the residue \(\Gamma_ F\) for every flag F such that \(\Gamma_ F\) has rank \(\geq 2\).