首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1802篇
  免费   203篇
  国内免费   132篇
化学   567篇
力学   30篇
综合类   21篇
数学   1140篇
物理学   379篇
  2024年   1篇
  2023年   22篇
  2022年   36篇
  2021年   30篇
  2020年   66篇
  2019年   54篇
  2018年   65篇
  2017年   70篇
  2016年   69篇
  2015年   61篇
  2014年   95篇
  2013年   148篇
  2012年   120篇
  2011年   144篇
  2010年   131篇
  2009年   176篇
  2008年   155篇
  2007年   103篇
  2006年   135篇
  2005年   98篇
  2004年   78篇
  2003年   63篇
  2002年   57篇
  2001年   45篇
  2000年   24篇
  1999年   19篇
  1998年   13篇
  1997年   10篇
  1996年   3篇
  1995年   11篇
  1994年   5篇
  1993年   8篇
  1992年   5篇
  1991年   1篇
  1990年   3篇
  1989年   3篇
  1988年   1篇
  1987年   2篇
  1985年   4篇
  1984年   1篇
  1975年   1篇
  1969年   1篇
排序方式: 共有2137条查询结果,搜索用时 31 毫秒
1.
Given a graph sequence denote by T3(Gn) the number of monochromatic triangles in a uniformly random coloring of the vertices of Gn with colors. In this paper we prove a central limit theorem (CLT) for T3(Gn) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T3(Gn), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7].  相似文献   
2.
3.
4.
A new approach was developed for synthesis of certain A3B3‐type of double hydrophilic or amphiphilic miktoarm star polymers using a combination of “grafting onto” and “grafting from” methods. To achieve the synthesis of desired miktoarm star polymers, acetyl protected poly(ethylene glycol) (PEG) thiols (Mn = 550 and 2000 g mol?1) were utilized to generate A3‐type of homoarm star polymers through an in situ protective group removal and a subsequent thiol–epoxy “click” reaction with a tris‐epoxide core viz. 1,1,1‐tris(4‐hydroxyphenyl)ethane triglycidyl ether. The secondary hydroxyl groups generated adjacent to the core upon the thiol–epoxy reaction were esterified with α‐bromoisobutyryl bromide to install atom transfer radical polymerization (ATRP) initiating sites. ATRP of N‐isopropylacrylamide (NIPAM) using the three‐arm star PEG polymer fitted with ATRP initiating sites adjacent to the core afforded A3B3‐type of double hydrophilic (PEG)3[poly(N‐isopropylacrylamide)] (PNIPAM)3 miktoarm star polymers. Furthermore, the generated hydroxyl groups were directly used as initiator for ring‐opening polymerization of ε‐caprolactone to prepare A3B3‐type of amphiphilic (PEG)3[poly(ε‐caprolactone)]3 miktoarm star polymers. The double hydrophilic (PEG)3(PNIPAM)3 miktoarm star polymers showed lower critical solution temperature around 34 °C. The preliminary transmission electron microscopy analysis indicated formation of self‐assembly of (PEG)3(PNIPAM)3 miktoarm star polymer in aqueous solution. © 2018 Wiley Periodicals, Inc. J. Polym. Sci., Part A: Polym. Chem. 2019 , 57, 146–156  相似文献   
5.
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time.  相似文献   
6.
The miktoarm star‐shaped poly(lactic acid) (PLA) copolymer, (PLLA)2‐core‐(PDLA)2, was synthesized via stepwise ring‐opening polymerization of lactide with dibromoneopentyl glycol as the starting material. 1H NMR and FTIR spectroscopy proved the feasibility of synthetic route and the successful preparation of star‐shaped PLA copolymers. The results of FTIR spectroscopy and XRD showed that the stereocomplex structure of the copolymer could be more perfect after solvent dissolution treatment. Effect of chain architectures on crystallization was investigated by studying the nonisothermal and isothermal crystallization of the miktoarm star‐shaped PLA copolymer and other stereocomplexes. Nonisothermal differential scanning calorimetry and polarizing optical microscopy tests indicated that (PLLA)2‐core‐(PDLA)2 exhibited the fastest formation of a stereocomplex in a dynamic test due to its special structure. In isothermal crystallization tests, the copolymer exhibited the fast crystal growth rate and the most perfect crystal morphology. The results reveal that the unique molecular structure has an important influence on the crystallization of the miktoarm star‐shaped PLA copolymer. © 2019 Wiley Periodicals, Inc. J. Polym. Sci., Part A: Polym. Chem. 2019 , 57, 814–826  相似文献   
7.
8.
9.
Recently, Balogh et al. (2018) answered in negative the question that was posed in several earlier papers whether the packing chromatic number is bounded in the class of graphs with maximum degree 3. In this note, we present an explicit infinite family of subcubic graphs with unbounded packing chromatic number.  相似文献   
10.
Smarandachely邻点可区别全染色是指相邻点的色集合互不包含的邻点可区别全染色,是对邻点可区别全染色条件的进一步加强。本文研究了平面图的Smarandachely邻点可区别全染色,即根据2-连通外平面图的结构特点,利用分析法、数学归纳法,刻画了最大度为5的2-连通外平面图的Smarandachely邻点可区别全色数。证明了:如果$G$是一个$\Delta (G)=5$的2-连通外平面图,则$\chi_{\rm sat}(G)\leqslant 9$。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号