نتایج جستجو برای: k maximal

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

Journal: :European Journal of Combinatorics 1998

Journal: :Journal of Garmian University 2017

Journal: :Journal of Combinatorial Theory, Series B 2018

Journal: :Acta Mathematicae Applicatae Sinica 2022

Let H = (V, E) be a hypergraph, where V is set of vertices and E non-empty subsets called edges. If all edges have the same cardinality r, then an r-uniform hypergraph; if consists r-subsets V, complete denoted by $$K_n^r$$ , n |V|. A hypergraph H′ (V′, E′) subhypergraph V′ ⊆ E′ E. The edge-connectivity minimum edge F such that − not connected, F). An k-edge-maximal every has at most k, but for...

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

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