In this paper,a strong converse inequality of type B in terms of a new Kfunctional Kλα f,t2(0 < α < 2,0 ≤λ≤ 1) for certain mixed Szász-Beta operators is given.By this inequality,the converse theorem c...In this paper,a strong converse inequality of type B in terms of a new Kfunctional Kλα f,t2(0 < α < 2,0 ≤λ≤ 1) for certain mixed Szász-Beta operators is given.By this inequality,the converse theorem can be obtained for the operators.展开更多
An edge coloring of hypergraph H is a function such that holds for any pair of intersecting edges . The minimum number of colors in edge colorings of H is called the chromatic index of H and is ...An edge coloring of hypergraph H is a function such that holds for any pair of intersecting edges . The minimum number of colors in edge colorings of H is called the chromatic index of H and is denoted by . Erdös, Faber and Lovász proposed a famous conjecture that holds for any loopless linear hypergraph H with n vertices. In this paper, we show that is true for gap-restricted hypergraphs. Our result extends a result of Alesandroni in 2021.展开更多
基金Supported by National Science Foundation of China(10571040)
文摘In this paper,a strong converse inequality of type B in terms of a new Kfunctional Kλα f,t2(0 < α < 2,0 ≤λ≤ 1) for certain mixed Szász-Beta operators is given.By this inequality,the converse theorem can be obtained for the operators.
文摘An edge coloring of hypergraph H is a function such that holds for any pair of intersecting edges . The minimum number of colors in edge colorings of H is called the chromatic index of H and is denoted by . Erdös, Faber and Lovász proposed a famous conjecture that holds for any loopless linear hypergraph H with n vertices. In this paper, we show that is true for gap-restricted hypergraphs. Our result extends a result of Alesandroni in 2021.