Year: 2014
Type: article
Abstract: 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 -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.
Source: Journal of Graph Theory
DOI: 10.1002/jgt.21808
Authors: Chaim Even‐Zohar, Nati Linial
Institution: Hebrew University of Jerusalem
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2950093755