A graph G with vertex set V is said to be n-existentially closed (or n-e.c. for short) if, for every proper subset S of V with |S|=n and every subset T of S, there exists a vertex x in V-S such that x ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback