Arithmetically maximal independent sets in infinite graphs
Discussiones Mathematicae Graph Theory, Tome 25 (2005) no. 1-2, p. 167.

Voir la notice de l'article dans European Digital Mathematics Library

Families of all sets of independent vertices in graphs are investigated. The problem how to characterize those infinite graphs which have arithmetically maximal independent sets is posed. A positive answer is given to the following classes of infinite graphs: bipartite graphs, line graphs and graphs having locally infinite clique-cover of vertices. Some counter examples are presented.
Classification : 05C69
Mots-clés : infinite graph, independent set, arithmetical maximal set, line graph 
@article{DMGT_2005__25_1-2_270448,
     author = {Stanis{\l}aw Bylka},
     title = {Arithmetically maximal independent sets in infinite graphs},
     journal = {Discussiones Mathematicae Graph Theory},
     pages = {167},
     publisher = {mathdoc},
     volume = {25},
     number = {1-2},
     year = {2005},
     zbl = {1077.05070},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/DMGT_2005__25_1-2_270448/}
}
TY  - JOUR
AU  - Stanisław Bylka
TI  - Arithmetically maximal independent sets in infinite graphs
JO  - Discussiones Mathematicae Graph Theory
PY  - 2005
SP  - 167
VL  - 25
IS  - 1-2
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/DMGT_2005__25_1-2_270448/
LA  - en
ID  - DMGT_2005__25_1-2_270448
ER  - 
%0 Journal Article
%A Stanisław Bylka
%T Arithmetically maximal independent sets in infinite graphs
%J Discussiones Mathematicae Graph Theory
%D 2005
%P 167
%V 25
%N 1-2
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/DMGT_2005__25_1-2_270448/
%G en
%F DMGT_2005__25_1-2_270448
Stanisław Bylka. Arithmetically maximal independent sets in infinite graphs. Discussiones Mathematicae Graph Theory, Tome 25 (2005) no. 1-2, p. 167. https://geodesic-test.mathdoc.fr/item/DMGT_2005__25_1-2_270448/