Geodesic
The Sperner property for polygonal graphs
Prikladnaya Diskretnaya Matematika. Supplement, no. 7 (2014), pp. 135-137

Voir la notice de l'article provenant de la source Math-Net.Ru

A finite partially ordered set (poset) is said to have the Sperner property if at least one of its maximum antichains is formed from elements of the same hight. A polygonal graph is a directed acyclic graph derived from a circuit by some orientation of its edges. The reachability relation of a polygonal graph is a partial order. A criterion is presented for posets associated with polygonal graphs to have the Sperner property.
Keywords: partially ordered set, Sperner property, polygonal graph, path, zigzag. 
@article{PDMA_2014_7_a57,
     author = {V. N. Salii},
     title = {The  {Sperner} property for polygonal graphs},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {135--137},
     publisher = {mathdoc},
     number = {7},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2014_7_a57/}
}
TY  - JOUR
AU  - V. N. Salii
TI  - The  Sperner property for polygonal graphs
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2014
SP  - 135
EP  - 137
IS  - 7
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2014_7_a57/
LA  - ru
ID  - PDMA_2014_7_a57
ER  - 
%0 Journal Article
%A V. N. Salii
%T The  Sperner property for polygonal graphs
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2014
%P 135-137
%N 7
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2014_7_a57/
%G ru
%F PDMA_2014_7_a57
V. N. Salii. The  Sperner property for polygonal graphs. Prikladnaya Diskretnaya Matematika. Supplement, no. 7 (2014), pp. 135-137. http://geodesic.mathdoc.fr/item/PDMA_2014_7_a57/