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

Polyunsaturated posets and graphs and the Greene-Kleitman theorem

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

DOI10.1016/S0012-365X(02)00433-8zbMath1011.06003arXivmath/9807175OpenAlexW2011001836MaRDI QIDQ1850016

Glenn G. Chappell

Publication date: 2 December 2002

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

Full work available at URL: https://arxiv.org/abs/math/9807175


zbMATH Keywords

\(k\)-saturated partition into chainspolyunsaturated posetsstrong Greene-Kleitman graph


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07)







This page was built for publication: Polyunsaturated posets and graphs and the Greene-Kleitman theorem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1850016&oldid=14234079"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki