Triply existentially complete triangle-free graphs

Chaim Even-Zohar, Nati Linial

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


A triangle-free graph G is called k-existentially complete if for every induced k-vertex subgraph H of G, every extension of H to a (k + 1)-vertex triangle-free graph can be realized by adding another vertex of G to H. Cherlin [11,12] asked whether k-existentially complete triangle-free graphs exist for every k. Here, we present known and new constructions of 3-existentially complete triangle-free graphs.

Original languageAmerican English
Pages (from-to)305-317
Number of pages13
JournalJournal of Graph Theory
Issue number4
StatePublished - 1 Apr 2015

Bibliographical note

Publisher Copyright:
© 2014 Wiley Periodicals, Inc.


Dive into the research topics of 'Triply existentially complete triangle-free graphs'. Together they form a unique fingerprint.

Cite this