A construction of 3-e.c. graphs using quadrances

Details A construction of 3-e.c. graphs using quadrances A construction of 3-e.c. graphs using quadrances

2009-03-13

arxiv.org/abs/0903.2509v1

Mathematics

Combinatorics

Scientific paper

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 \cap B = \emptyset$ and $|A| + |B| = n$, there is a vertex $z$ not in $A \cup 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 $\mathbbm{Z}_p^d$.

Affiliated with

Also associated with

No associations

Rating

A construction of 3-e.c. graphs using quadrances does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A construction of 3-e.c. graphs using quadrances, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A construction of 3-e.c. graphs using quadrances will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-235798