全文获取类型
收费全文 | 2051篇 |
免费 | 338篇 |
国内免费 | 118篇 |
专业分类
化学 | 126篇 |
晶体学 | 15篇 |
力学 | 163篇 |
综合类 | 51篇 |
数学 | 1381篇 |
物理学 | 771篇 |
出版年
2023年 | 33篇 |
2022年 | 79篇 |
2021年 | 50篇 |
2020年 | 90篇 |
2019年 | 75篇 |
2018年 | 85篇 |
2017年 | 88篇 |
2016年 | 71篇 |
2015年 | 53篇 |
2014年 | 112篇 |
2013年 | 166篇 |
2012年 | 108篇 |
2011年 | 159篇 |
2010年 | 129篇 |
2009年 | 184篇 |
2008年 | 169篇 |
2007年 | 120篇 |
2006年 | 136篇 |
2005年 | 104篇 |
2004年 | 95篇 |
2003年 | 74篇 |
2002年 | 73篇 |
2001年 | 51篇 |
2000年 | 29篇 |
1999年 | 28篇 |
1998年 | 23篇 |
1997年 | 21篇 |
1996年 | 14篇 |
1995年 | 20篇 |
1994年 | 11篇 |
1993年 | 12篇 |
1992年 | 7篇 |
1991年 | 10篇 |
1990年 | 5篇 |
1989年 | 4篇 |
1988年 | 3篇 |
1987年 | 6篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有2507条查询结果,搜索用时 15 毫秒
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.
Multistrain diseases, which are infected through individual contacts, pose severe public health threat nowadays. In this paper, we build competitive and mutative two‐strain edge‐based compartmental models using probability generation function (PGF) and pair approximation (PA). Both of them are ordinary differential equations. Their basic reproduction numbers and final size formulas are explicitly derived. We show that the formula gives a unique positive final epidemic size when the reproduction number is larger than unity. We further consider competitive and mutative multistrain diseases spreading models and compute their basic reproduction numbers. We perform numerical simulations that show some dynamical properties of the competitive and mutative two‐strain models. 相似文献
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.
7.
8.
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. 相似文献
9.
Smarandachely邻点可区别全染色是指相邻点的色集合互不包含的邻点可区别全染色,是对邻点可区别全染色条件的进一步加强。本文研究了平面图的Smarandachely邻点可区别全染色,即根据2-连通外平面图的结构特点,利用分析法、数学归纳法,刻画了最大度为5的2-连通外平面图的Smarandachely邻点可区别全色数。证明了:如果$G$ 是一个$\Delta (G)=5$ 的2-连通外平面图,则$\chi_{\rm sat}(G)\leqslant 9$ 。 相似文献
10.
Nursel Erey 《代数通讯》2018,46(9):4007-4020
We show that if G is a gap-free and diamond-free graph, then I(G)s has a linear minimal free resolution for every s≥2. 相似文献