A construction of 3-e.c. graphs using quadrances
| dc.creator | Vinh, Le Anh | |
| dc.date | 2009-03-13 | |
| dc.date.accessioned | 2026-07-07T12:52:40Z | |
| dc.date.available | 2026-07-07T12:52:40Z | |
| dc.description | 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$. | |
| dc.identifier | https://arxiv.org/abs/0903.2509 | |
| dc.identifier | http://arxiv.org/abs/0903.2509 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/223371 | |
| dc.subject | Combinatorics | |
| dc.title | A construction of 3-e.c. graphs using quadrances | |
| dc.type | text |