نتایج جستجو برای: saturation

تعداد نتایج: 48897  

Journal: :Discrete Mathematics 2019

Journal: :Glasnik Matematicki 2007

Journal: :Acta Medica Scandinavica 2009

Journal: :Vision Research 1977

Journal: :Random Structures & Algorithms 2016

Journal: :Discrete Mathematics 2019

Journal: :British Dental Journal 2019

Journal: :Journal of Research of the National Bureau of Standards, Section C: Engineering and Instrumentation 1968

Journal: :Electronic Journal of Combinatorics 2023

For a given positive integer $k$ we say that family of subsets $[n]$ is $k$-antichain saturated if it does not contain pairwise incomparable sets, but whenever add to new set, do find such sets. The size the smallest denoted by $\text{sat}^*(n, \mathcal A_{k})$. Ferrara, Kay, Kramer, Martin, Reiniger, Smith and Sullivan conjectured A_{k})=(k-1)n(1+o(1))$, proved this for $k\leq 4$. In paper pro...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید