نتایج جستجو برای: k
تعداد نتایج: 377703 فیلتر نتایج به سال:
We introduce new techniques for studying the structure of partial k-trees. In particular, we show that the complements of partial k-trees provide an intuitively-appealing characterization of partial k-tree obstructions. We use this characterization to obtain a lower bound of 2 (k log k) on the number of obstructions, signi cantly improving the previously best-known bound of 2 ( p . Our techniqu...
In this paper, we introduce the notion of strongly $k-$spaces (with the weak (=finest) pre-topology generated by their strongly compact subsets). We characterize the strongly $k-$spaces and investigate the relationships between preclosedness, locally strongly compactness, pre-first countableness and being strongly $k-$space.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید