Triply existentially complete triangle-free graphs

C. Even-Zohar; N. Linial

doi:10.1002/jgt.21808

Triply existentially complete triangle-free graphs

C. Even-Zohar, N. Linial

Technion - Israel Institute of Technology, The Hebrew University of Jerusalem

Research output: Contribution to journal › Article › peer-review

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 (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 language	American English
Pages (from-to)	305-317
Number of pages	13
Journal	Journal of Graph Theory
Volume	78
Issue number	4
DOIs	https://doi.org/10.1002/jgt.21808
State	Published - 1 Apr 2015

All Science Journal Classification (ASJC) codes

Geometry and Topology

Access to Document

10.1002/jgt.21808

https://www.scopus.com/inward/record.uri?eid=2-s2.0-84922309612&doi=10.1002%2fjgt.21808&partnerID=40&md5=bbc9a4cdfa222629c7a453e10388e220

Cite this

@article{5d3f7e994d964561ba4427cea6c3dcf8,

title = "Triply existentially complete triangle-free graphs",

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 (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.",

author = "C. Even-Zohar and N. Linial",

note = "Cited By :2 Export Date: 21 February 2022",

year = "2015",

month = apr,

day = "1",

doi = "10.1002/jgt.21808",

language = "American English",

volume = "78",

pages = "305--317",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "4",

}

TY - JOUR

T1 - Triply existentially complete triangle-free graphs

AU - Even-Zohar, C.

AU - Linial, N.

N1 - Cited By :2 Export Date: 21 February 2022

PY - 2015/4/1

Y1 - 2015/4/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84922309612&partnerID=8YFLogxK

U2 - 10.1002/jgt.21808

DO - 10.1002/jgt.21808

M3 - Article

SN - 0364-9024

VL - 78

SP - 305

EP - 317

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 4

ER -

Triply existentially complete triangle-free graphs

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this