Standard

Quasivarieties of Graphs and Independent Axiomatizability. / Kravchenko, A. V.; Yakovlev, A. V.

в: Siberian Advances in Mathematics, Том 28, № 1, 01.01.2018, стр. 53-59.

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

Harvard

Kravchenko, AV & Yakovlev, AV 2018, 'Quasivarieties of Graphs and Independent Axiomatizability', Siberian Advances in Mathematics, Том. 28, № 1, стр. 53-59. https://doi.org/10.3103/S1055134418010042

APA

Kravchenko, A. V., & Yakovlev, A. V. (2018). Quasivarieties of Graphs and Independent Axiomatizability. Siberian Advances in Mathematics, 28(1), 53-59. https://doi.org/10.3103/S1055134418010042

Vancouver

Kravchenko AV, Yakovlev AV. Quasivarieties of Graphs and Independent Axiomatizability. Siberian Advances in Mathematics. 2018 янв. 1;28(1):53-59. doi: 10.3103/S1055134418010042

Author

Kravchenko, A. V. ; Yakovlev, A. V. / Quasivarieties of Graphs and Independent Axiomatizability. в: Siberian Advances in Mathematics. 2018 ; Том 28, № 1. стр. 53-59.

BibTeX

@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.}",
note = "Publisher Copyright: {\textcopyright} 2018, Allerton Press, Inc.",
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",

}

RIS

TY - JOUR

T1 - Quasivarieties of Graphs and Independent Axiomatizability

AU - Kravchenko, A. V.

AU - Yakovlev, A. V.

N1 - Publisher Copyright: © 2018, Allerton Press, Inc.

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 -

ID: 10427731