Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Another proof of Dilworth's decomposition theorem

From MaRDI portal
Publication:1252854
Jump to:navigation, search

DOI10.1016/0012-365X(79)90157-2zbMath0395.05001MaRDI QIDQ1252854

Oliver Pretzel

Publication date: 1979

Published in: Discrete Mathematics (Search for Journal in Brave)


zbMATH Keywords

coveringpartially ordered setDilworth's decomposition theoremmaximal sized antichains


Mathematics Subject Classification ID

Partial orders, general (06A06) Permutations, words, matrices (05A05) Combinatorial aspects of packing and covering (05B40)




Cites Work

  • Unnamed Item
  • A proof of Dilworth's decomposition theorem for partially ordered sets
  • A decomposition theorem for partially ordered sets
  • Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
  • On Dilworth's decomposition theorem for partially ordered sets
  • The structure of Sperner k-families
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1252854&oldid=13343633"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 09:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki