A construction of 3-existentially closed graphs using quadrances

Abstract: A graph is

n

-e.c. (

n

-existentially closed) if for every pair of subsets

A, B

of vertex set

V

of the graph such that

A c a p B = e m p t y s e t

and

| A | + | B | = n

, there is a vertex

z

not in

A c u p B

joined to each vertex of

A

and no vertex of

B

. Few explicit families of

n

-e.c. are known for

n > 2

. In this short note, we give a new construction of 3-e.c. graphs using the notion of quadrance in the finite Euclidean space

m a t h b b m Z_{p}^{d}

.

Recommendations

Cited in

(8)

This page was built for publication: A construction of 3-existentially closed graphs using quadrances