@article{oai:bunkyo.repo.nii.ac.jp:00005752,
 author = {Okamoto, Yoshio},
 journal = {情報研究, Information and Communication Studies},
 month = {2000-01-01, 2011-02-23},
 note = {Antimatroids are antipodal to matroids, which are considered as combinatorial abstraction of　convexity. We consider an extension of Dilworth's decomposition theorem for partially ordered sets,　which states that the maximum size of antichains is equal to the minimum number of chains which　cover the ground set for any partially ordered set. In particular, we investigate the relationship between
the extended statement and circuits of antimatroids., 情報学シンポジウム特集号\nタイトル日本語表記 : アンチマトロイドのサーキットとDilworthの分解定理\n著者名日本語表記 : 岡本, 吉央},
 pages = {43--53},
 title = {Circuits of Antimatoriods and Dilworth's Decomposition Theorem},
 volume = {25},
 year = {}
}