The strong Hall property and symmetric chain orders
Publication in refereed journal


引用次數
替代計量分析
.

其它資訊
摘要Let G = (X, Y; E) be a bipartite graph with \X\ greater than or equal to \Y\. For A subset of or equal to X, write phi(A) = \A\ - \N(A)\ and for a less than or equal to \X\, define phi(a) = max{phi(A) \ A subset of or equal to X, \A\ = a}. The graph G is said to have the strong Hall property if phi(a) + phi(b) less than or equal to \X\ - \Y\ for all nonnegative integers a and b with a + b less than or equal to \X\. We shall prove that any unimodal and self-dual poset with the strong Hall property is a symmetric chain order. This result will also be used to show that the inversion poset S-5 is a symmetric chain order. (C) 1999 Elsevier Science B.V. All rights reserved.
著者Lu XY, Wang DW, Wong CK
期刊名稱Discrete Mathematics
出版年份1999
月份5
日期28
卷號203
期次1-3
出版社ELSEVIER SCIENCE BV
頁次161 - 168
國際標準期刊號0012-365X
語言英式英語
關鍵詞bipartite matching; Hall's condition; strong Hall property; symmetric chain orders
Web of Science 學科類別Mathematics; MATHEMATICS

上次更新時間 2021-21-02 於 23:50