Quasivarieties of Graphs and Independent Axiomatizability

A. V. Kravchenko; A. V. Yakovlev

doi:10.3103/S1055134418010042

Quasivarieties of Graphs and Independent Axiomatizability

A. V. Kravchenko, A. V. Yakovlev

Кафедра дискретной математики и информатики ММФ и СУНЦ

Результат исследования: Научные публикации в периодических изданиях › статья › рецензирование

3 Цитирования (Scopus)

Аннотация

In the present article, we continue to study the complexity of the lattice of quasivarieties of graphs. For every quasivariety K of graphs that contains a non-bipartite graph, we find a subquasivariety K′ ⊆ K such that there exist 2^ω subquasivarieties K″ ∈ L_q(K′) without covers (hence, without independent bases for their quasi-identities in K′).

Язык оригинала	английский
Страницы (с-по)	53-59
Число страниц	7
Журнал	Siberian Advances in Mathematics
Том	28
Номер выпуска	1
DOI	https://doi.org/10.3103/S1055134418010042
Состояние	Опубликовано - 1 янв 2018

Доступ к документу

10.3103/S1055134418010042

Другие файлы и ссылки

Link to publication in Scopus

Цитировать

@article{1218c8ea76e3425d8669a1427747bea5,

title = "Quasivarieties of Graphs and Independent Axiomatizability",

abstract = "In the present article, we continue to study the complexity of the lattice of quasivarieties of graphs. For every quasivariety K of graphs that contains a non-bipartite graph, we find a subquasivariety K′ ⊆ K such that there exist 2ω subquasivarieties K″ ∈ Lq(K′) without covers (hence, without independent bases for their quasi-identities in K′).",

keywords = "basis for quasi-identities, graph, quasivariety",

author = "Kravchenko, {A. V.} and Yakovlev, {A. V.}",

year = "2018",

month = jan,

day = "1",

doi = "10.3103/S1055134418010042",

language = "English",

volume = "28",

pages = "53--59",

journal = "Siberian Advances in Mathematics",

issn = "1055-1344",

publisher = "PLEIADES PUBLISHING INC",

number = "1",

}

TY - JOUR

T1 - Quasivarieties of Graphs and Independent Axiomatizability

AU - Kravchenko, A. V.

AU - Yakovlev, A. V.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - In the present article, we continue to study the complexity of the lattice of quasivarieties of graphs. For every quasivariety K of graphs that contains a non-bipartite graph, we find a subquasivariety K′ ⊆ K such that there exist 2ω subquasivarieties K″ ∈ Lq(K′) without covers (hence, without independent bases for their quasi-identities in K′).

AB - In the present article, we continue to study the complexity of the lattice of quasivarieties of graphs. For every quasivariety K of graphs that contains a non-bipartite graph, we find a subquasivariety K′ ⊆ K such that there exist 2ω subquasivarieties K″ ∈ Lq(K′) without covers (hence, without independent bases for their quasi-identities in K′).

KW - basis for quasi-identities

KW - graph

KW - quasivariety

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

U2 - 10.3103/S1055134418010042

DO - 10.3103/S1055134418010042

M3 - Article

AN - SCOPUS:85043535226

VL - 28

SP - 53

EP - 59

JO - Siberian Advances in Mathematics

JF - Siberian Advances in Mathematics

SN - 1055-1344

IS - 1

ER -

Quasivarieties of Graphs and Independent Axiomatizability

Аннотация

Доступ к документу

Другие файлы и ссылки

Fingerprint

Цитировать