全文获取类型
收费全文 | 5719篇 |
免费 | 569篇 |
国内免费 | 557篇 |
专业分类
化学 | 847篇 |
晶体学 | 8篇 |
力学 | 286篇 |
综合类 | 116篇 |
数学 | 4183篇 |
物理学 | 1405篇 |
出版年
2024年 | 14篇 |
2023年 | 53篇 |
2022年 | 141篇 |
2021年 | 147篇 |
2020年 | 151篇 |
2019年 | 146篇 |
2018年 | 177篇 |
2017年 | 172篇 |
2016年 | 177篇 |
2015年 | 133篇 |
2014年 | 261篇 |
2013年 | 466篇 |
2012年 | 245篇 |
2011年 | 302篇 |
2010年 | 256篇 |
2009年 | 373篇 |
2008年 | 438篇 |
2007年 | 394篇 |
2006年 | 372篇 |
2005年 | 301篇 |
2004年 | 255篇 |
2003年 | 254篇 |
2002年 | 239篇 |
2001年 | 196篇 |
2000年 | 192篇 |
1999年 | 159篇 |
1998年 | 152篇 |
1997年 | 121篇 |
1996年 | 113篇 |
1995年 | 73篇 |
1994年 | 58篇 |
1993年 | 37篇 |
1992年 | 30篇 |
1991年 | 28篇 |
1990年 | 23篇 |
1989年 | 11篇 |
1988年 | 17篇 |
1987年 | 13篇 |
1986年 | 17篇 |
1985年 | 12篇 |
1984年 | 15篇 |
1983年 | 13篇 |
1982年 | 19篇 |
1981年 | 13篇 |
1980年 | 18篇 |
1979年 | 14篇 |
1978年 | 10篇 |
1977年 | 6篇 |
1976年 | 6篇 |
1974年 | 4篇 |
排序方式: 共有6845条查询结果,搜索用时 31 毫秒
1.
2.
3.
4.
《Journal of Pure and Applied Algebra》2022,226(8):107024
We solve a combinatorial question concerning eigenvalues of the universal intertwining endomorphism of a subset representation. 相似文献
5.
6.
A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs. 相似文献
7.
《Indagationes Mathematicae》2022,33(1):218-237
We define the notion of basic set data for finite groups (building on the notion of basic set, but including an order on the irreducible characters as part of the structure), and we prove that the Springer correspondence provides basic set data for Weyl groups. Then we use this to determine explicitly the modular Springer correspondence for classical types (defined over a base field of odd characteristic , and with coefficients in a field of odd characteristic ): the modular case is obtained as a restriction of the ordinary case to a basic set. In order to do so, we compare the order on bipartitions introduced by Dipper and James with the order induced by the Springer correspondence. We provide a quick proof, by sorting characters according to the dimension of the corresponding Springer fibre, an invariant which is directly computable from symbols. 相似文献
8.
9.
《Discrete Mathematics》2020,343(12):112117
Let be an edge-colored graph of order . The minimum color degree of , denoted by , is the largest integer such that for every vertex , there are at least distinct colors on edges incident to . We say that an edge-colored graph is rainbow if all its edges have different colors. In this paper, we consider vertex-disjoint rainbow triangles in edge-colored graphs. Li (2013) showed that if , then contains a rainbow triangle and the lower bound is tight. Motivated by this result, we prove that if and , then contains two vertex-disjoint rainbow triangles. In particular, we conjecture that if , then contains vertex-disjoint rainbow triangles. For any integer , we show that if and , then contains vertex-disjoint rainbow triangles. Moreover, we provide sufficient conditions for the existence of edge-disjoint rainbow triangles. 相似文献
10.
The finiteness is proved of the set of isomorphism classes of potentially abelian geometric Galois representations with a given set of data. This is a special case of the finiteness conjecture of Fontaine and Mazur. 相似文献