It has been conjectured that r(C nl Km) = (m-1)(n-1) + 1 for all (n, m) =1= (3,3) satisfying n ~ m. We prove this for the case m = 5.
BACKGROUND Leukemia, a heterogeneous clonal disorder of hematopoietic progenitor cells, presents a world-wide health problem, especially in childhood. F1F0 ATPase, an inner mitochondrial enzyme, is expressed on the plasma membrane of tumor cells, and its inhibition induces both anti-angiogenic and anti-tumorigenic activity. METHODS Monoclonal Antibody… (More)
BACKGROUND Reports on antiretroviral therapy (ART) adherence are scare in China; we performed this meta-analysis to estimate ART adherence rates in different populations at high risk for HIV transmission in China. METHODS We searched PubMed, Chinese Biomedical Literature Database (Chinese), China National Knowledge Infrastructure (Chinese), and Wanfang… (More)
This article reviewed the development of lignocellulosic biomass pretreatment technology, influencing parameter of anaerobic fermentation and fermentation technology. The characteristic of lignocellulose is analyzed. Pretreatment of Lignocellulosic biomass including physical, chemical, biological and thermal pretreatments. Influencing parameter of anaerobic… (More)
The Ramsey number R(C n , Km) is the smallest integer p such that any graph G on p vertices either contains a cycle C n with length n or contains an independent set with order m. In this paper we prove that R(C n , K 4) = 3(n-1) + 1 (n ~ 4). We shall only consider graphs without multiple edges or loops. The Ramsey number R(Cn,K m) is the smallest integer p… (More)