Author:
Bezrukov Sergei L.,Leck Uwe
Abstract
Macaulay posets are posets for which there is an analogue of the classical Kruskal-Katona theorem for finite sets. These posets are of great importance in many branches of combinatorics and have numerous applications. We survey mostly new and also some old results on Macaulay posets, where the intention is to present them as pieces of a general theory. In particular, the classical examples of Macaulay posets are included as well as new ones. Emphasis is also put on the construction of Macaulay posets, and their relations to other discrete optimization problems.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Weak Ratio Rules;Developments in Data Extraction, Management, and Analysis;2013
2. Gotzmann squarefree ideals;Illinois Journal of Mathematics;2012-01-01
3. Weak Ratio Rules;International Journal of Data Warehousing and Mining;2011-07
4. The vertex isoperimetric problem for the powers of the diamond graph;Discrete Mathematics;2008-06