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, 2015, Issue 8, Pages 124–127
DOI: https://doi.org/10.17223/2226308X/8/47 (Mi pdma243) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Applied Theory of Coding, Automata and Graphs

The Sperner property for trees

V. N. Salii

Saratov State University, Saratov
Full-text PDF (544 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.17223/2226308X/8/47
Abstract: The reachability relation of a directed acyclic graph is a partial order on the set of its vertices. One of the interesting properties of a partially ordered set is its Sperner property that means that at least one of maximum antichains is formed from elements of the same height. In graphs with the reachability relation, this property is discussed for out-trees and in-trees, it is modified and studied for functional and contrafunctional digraphs closely related to these trees, and for unoriented trees also.
Keywords: partially ordered set, Sperner property, tree, acyclic digraph, out-tree, in-tree, functional digraph, contrafunctional digraph.
Document Type: Article
UDC: 519.17
Language: Russian
Citation: V. N. Salii, “The Sperner property for trees”, Prikl. Diskr. Mat. Suppl., 2015, no. 8, 124–127
Citation in format AMSBIB
\Bibitem{Sal15}
\by V.~N.~Salii
\paper The Sperner property for trees
\jour Prikl. Diskr. Mat. Suppl.
\yr 2015
\issue 8
\pages 124--127
\mathnet{http://mi.mathnet.ru/pdma243}
\crossref{https://doi.org/10.17223/2226308X/8/47}
Linking options:
  • https://www.mathnet.ru/eng/pdma243
  • https://www.mathnet.ru/eng/pdma/y2015/i8/p124
    • 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:142
    Full-text PDF :45
    References:22
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024