1978
DOI: 10.1016/0012-365x(78)90062-6
|View full text |Cite
|
Sign up to set email alerts
|

On classes of relations and graphs determined by subobjects and factorobjects

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
63
0

Year Published

1987
1987
2014
2014

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 95 publications
(65 citation statements)
references
References 5 publications
2
63
0
Order By: Relevance
“…. , A n−1 and several weak subgraphs of B n , their number growing quadratically with n. It follows from (1) that C n is generated as a quasivariety by the single graph B n , a result first obtained by Nesetȓil and Pultr [12]. Wheeler [17] proved independently that C n is generated by a single finite graph (distinct from B n ), in order to show that C n has a ω-categorical model companion with a primitive recursive axiomatization.…”
Section: Introductionmentioning
confidence: 72%
See 3 more Smart Citations
“…. , A n−1 and several weak subgraphs of B n , their number growing quadratically with n. It follows from (1) that C n is generated as a quasivariety by the single graph B n , a result first obtained by Nesetȓil and Pultr [12]. Wheeler [17] proved independently that C n is generated by a single finite graph (distinct from B n ), in order to show that C n has a ω-categorical model companion with a primitive recursive axiomatization.…”
Section: Introductionmentioning
confidence: 72%
“…3. In [12], B n is described as a disjoint sum of K n−2 and a 3-chain. Wheeler [17] gives a distinct generator for C n .…”
Section: The Quasivariety Of N-colorable Graphsmentioning
confidence: 99%
See 2 more Smart Citations
“…However, the last result we wish to recall states that this implication does hold for universal Horn classes generated by a finite number of finite simple graphs. Such a class is standard iff it is one of ∅, [17,Theorem 2.4], and all of them are finitely axiomatizable [12,Theorem 3.2].…”
Section: Relational Structuresmentioning
confidence: 99%