Title 
The search for the smallest 3e.c. graphs

Authors/Editors* 
P.Gordinowicz and P.Pralat

Where published* 
Journal of Combinatorial Mathematics and Combinatorial Computing 
How published* 
Journal 
Year* 
2010 
Volume 
74 
Number 

Pages 
129142 
Publisher 

Keywords 

Link 
http://www.math.ryerson.ca/~pralat/research.html 
Abstract

A graph G is 3existentially closed (3e.c.) if each 3set of vertices can be extended in all of the possible eight ways. Results which improve the lower bound of the minimum order of a 3e.c. graph are reported. It has been shown that mec(3) \ge 24 where mec(3) is defined to be the minimum order of a 3e.c. graph. 