Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Prikladnaya Diskretnaya Matematika. Supplement, 2014, Issue 7, Pages 135–137 (Mi pdma176)  
This article is cited in 2 scientific papers (total in 2 papers)

Applied graph theory

The Sperner property for polygonal graphs

V. N. Salii

Saratov State University, Saratov
Full-text PDF (447 kB) Citations (2)
References:
PDF
HTML
Abstract: 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.
Document Type: Article
UDC: 519.17
Language: Russian
Citation: V. N. Salii, “The Sperner property for polygonal graphs”, Prikl. Diskr. Mat. Suppl., 2014, no. 7, 135–137
Citation in format AMSBIB
\Bibitem{Sal14}
\by V.~N.~Salii
\paper The Sperner property for polygonal graphs
\jour Prikl. Diskr. Mat. Suppl.
\yr 2014
\issue 7
\pages 135--137
\mathnet{http://mi.mathnet.ru/pdma176}
Linking options:
  • https://www.mathnet.ru/eng/pdma176
  • https://www.mathnet.ru/eng/pdma/y2014/i7/p135
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Prikladnaya Diskretnaya Matematika. Supplement
    Statistics & downloads:
    Abstract page:153
    Full-text PDF :61
    References:39
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024