Geodesic
The Sperner property for polygonal graphs considered as partially ordered sets
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 16 (2016) no. 2, pp. 226-231

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

A finite poset is said to have the Sperner property if at least one of its maximum antichains is formed from elements of the same height. 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. 
@article{ISU_2016_16_2_a13,
     author = {V. N. Salii},
     title = {The {Sperner} property for polygonal graphs considered as partially ordered sets},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {226--231},
     publisher = {mathdoc},
     volume = {16},
     number = {2},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ISU_2016_16_2_a13/}
}
TY  - JOUR
AU  - V. N. Salii
TI  - The Sperner property for polygonal graphs considered as partially ordered sets
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2016
SP  - 226
EP  - 231
VL  - 16
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ISU_2016_16_2_a13/
LA  - ru
ID  - ISU_2016_16_2_a13
ER  - 
%0 Journal Article
%A V. N. Salii
%T The Sperner property for polygonal graphs considered as partially ordered sets
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2016
%P 226-231
%V 16
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ISU_2016_16_2_a13/
%G ru
%F ISU_2016_16_2_a13
V. N. Salii. The Sperner property for polygonal graphs considered as partially ordered sets. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 16 (2016) no. 2, pp. 226-231. http://geodesic.mathdoc.fr/item/ISU_2016_16_2_a13/