A short proof of the existence of k-saturated partitions of partially ordered sets (Q1137582): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0001-8708(79)90010-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042626467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of Sperner k-families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some partitions associated with a partially ordered set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On partitions of a partially ordered set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversal theory. An account of some aspects of combinatorial mathematics / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:32, 13 June 2024

scientific article
Language Label Description Also known as
English
A short proof of the existence of k-saturated partitions of partially ordered sets
scientific article

    Statements

    A short proof of the existence of k-saturated partitions of partially ordered sets (English)
    0 references
    0 references
    1979
    0 references
    0 references
    finite partially ordered set
    0 references
    totally ordered sets
    0 references
    partitions
    0 references
    Dilworth's theorem
    0 references
    0 references