|
Computer Sciences
The Sperner property for polygonal graphs considered as partially ordered sets
V. N. Salii Saratov State University, 83, Astrakhanskaya st., 410012, Saratov, Russia
Abstract:
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.
Key words:
partially ordered set, Sperner property, polygonal graph, path, zigzag.
Citation:
V. N. Salii, “The Sperner property for polygonal graphs considered as partially ordered sets”, Izv. Saratov Univ. Math. Mech. Inform., 16:2 (2016), 226–231
Linking options:
https://www.mathnet.ru/eng/isu640 https://www.mathnet.ru/eng/isu/v16/i2/p226
|
Statistics & downloads: |
Abstract page: | 182 | Full-text PDF : | 74 | References: | 45 |
|