An Improvement of the General Bound on the Largest Family of Subsets Avoiding a Subposet
Sign Up to like & getrecommendations! Published in 2017 at "Order"
DOI: 10.1007/s11083-016-9390-3
Abstract: Let La(n, P) be the maximum size of a family of subsets of [n] = {1, 2, … , n} not containing P as a (weak) subposet, and let h(P) be the length of a… read more here.
Keywords: begin array; left begin; family; right left ... See more keywords