Paper Info
Title
An improvement on a Spernerity proof of Horrocks
Abstract
In Horrocks' proof (Horrocks, European Journal of Combinatorics 20 (1999) 131-148) of Lih's conjecture about the Spernerity of filters in a Boolean algebra generated by 2-subsets, there are 116 exceptional graphs to be checked case by case. The details of the analysis could not be published in its entirety. In this paper we carry Horrocks' method much further to reduce the exceptional cases to a manageable number. A complete examination can thus be exhibited.
Year
DOI
Venue
2001
10.1016/S0304-3975(00)00255-3
Theor. Comput. Sci.
Keywords
DocType
Volume
complete examination,exceptional case,Boolean algebra,manageable number,European Journal,exceptional graph,Spernerity proof
Journal
263
Issue
ISSN
Citations 
1-2
Theoretical Computer Science
0
PageRank 
References 
Authors
0.34
4
2
Name
Order
Citations
PageRank
Szu-En Cheng,100.34
Ko-wei Lih252958.80