# Publication: The search for the smallest 3-e.c. graphs

All || By Area || By YearTitle | The search for the smallest 3-e.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 | 129-142 |

Publisher | |

Keywords | |

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

Abstract |
A graph G is 3-existentially closed (3-e.c.) if each 3-set of vertices can be extended in all of the possible eight ways. Results which improve the lower bound of the minimum order of a 3-e.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 3-e.c. graph. |

Back to page 29 of list