全文获取类型
收费全文 | 950篇 |
免费 | 51篇 |
国内免费 | 81篇 |
专业分类
化学 | 11篇 |
力学 | 11篇 |
综合类 | 4篇 |
数学 | 1008篇 |
物理学 | 48篇 |
出版年
2024年 | 3篇 |
2023年 | 11篇 |
2022年 | 19篇 |
2021年 | 16篇 |
2020年 | 27篇 |
2019年 | 33篇 |
2018年 | 28篇 |
2017年 | 18篇 |
2016年 | 20篇 |
2015年 | 12篇 |
2014年 | 31篇 |
2013年 | 100篇 |
2012年 | 50篇 |
2011年 | 55篇 |
2010年 | 50篇 |
2009年 | 61篇 |
2008年 | 69篇 |
2007年 | 47篇 |
2006年 | 56篇 |
2005年 | 50篇 |
2004年 | 31篇 |
2003年 | 42篇 |
2002年 | 44篇 |
2001年 | 31篇 |
2000年 | 24篇 |
1999年 | 28篇 |
1998年 | 23篇 |
1997年 | 27篇 |
1996年 | 18篇 |
1995年 | 14篇 |
1994年 | 12篇 |
1993年 | 1篇 |
1992年 | 5篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 5篇 |
1982年 | 3篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1978年 | 2篇 |
1976年 | 1篇 |
排序方式: 共有1082条查询结果,搜索用时 218 毫秒
71.
In this paper we present a combinatorial proof of the Kronecker–Weber Theorem for global fields of positive characteristic. The main tools are the use of Witt vectors and their arithmetic developed by H.L. Schmid. The key result is to obtain, using counting arguments, how many p-cyclic extensions exist of fixed degree and bounded conductor where only one prime ramifies. We then compare this number with the number of subextensions of cyclotomic function fields of the same type and verify that these two numbers are the same. 相似文献
72.
We propose a homological approach to two conjectures descended from the Erdös-Ko-Rado Theorem, one due to Chvátal and the other to Frankl and Füredi. We apply the method to reprove, and in one case improve, results of these authors related to their conjectures. 相似文献
73.
本文利用Lovasz局部引理的Spencer形式和对称形式给出r-一致超图Ramsey函数的渐近下界.证明了:对于任意取定的正整数f0,使得当n→∞时,有R~((r))(m~l,n~(k-l))≥(c-o(1))(n~(r-1)/logn)~■.特别地,R~((r))_k(n)≥(1-o(1))n/e k~■(n→∞).对于任意取定的正整数s≥r+1和常数δ>0,α≥0,如果F表示阶为s的r-一致超图,■表示阶为t的r-一致超图,且■的边数满足m(■)≥(δ-o(1))t~r/(logt)α(t→∞),则存在c=c(s,δ,α)>0,使得R~((r))(F,■)≥(c-o(1))(t~(r-1)/(logt)~l+(r-l)α)~(m(F)-l/s-r). 相似文献
74.
75.
We characterize those positive functions which are invariant for a bounded kernel, and which have a Choquet-type integral representation. Such a representation relies on the wellknown Choquet-type integral representation of measures which are invariant for a kernel. We apply our results to convolution kernels with spread-out measures on second countable locally compact Abelian groups. 相似文献
76.
The Ramsey number R(G1,G2,…,Gk) is the least integer p so that for any k-edge coloring of the complete graph Kp, there is a monochromatic copy of Gi of color i. In this paper, we derive upper bounds of R(G1,G2,…,Gk) for certain graphs Gi. In particular, these bounds show that R(9,9)6588 and R(10,10)23556 improving the previous best bounds of 6625 and 23854. 相似文献
77.
David R. Wood 《Graphs and Combinatorics》2007,23(3):337-352
A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following
graph classes: (1) graphs with n vertices and m edges; (2) graphs with n vertices, m edges, and maximum degree Δ; (3) d-degenerate graphs with n vertices and m edges; (4) planar graphs with n vertices and m edges; and (5) graphs with n vertices and no K5-minor or no K3,3-minor. For example, the maximum number of cliques in a planar graph with n vertices is 8(n − 2).
Research supported by a Marie Curie Fellowship of the European Community under contract 023865, and by the projects MCYT-FEDER
BFM2003-00368 and Gen. Cat 2001SGR00224. 相似文献
78.
该文给出:对于偶数m≥4当n→ ∞时 r(Wm,Kn)≤l(1+o(1))C1(m) (n/logn ) (2m-2)/(m-2)对于奇数m≥5当n→∞时r(Wm,Kn)≤(1+o(1))C2(m) (n2m/m+1/log n)(m+1)/(m-1) .特别地,C2(5)=12. 以及 c(n/logn)5/2≤r(K4,Kn)≤ (1+o(1)) n3/(logn)2.此外,该文还讨论了轮和完全图的 Ramsey 数的一些推广. 相似文献
79.
Xuding Zhu 《Discrete Mathematics》1998,190(1-3):215-222
Suppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: for any 2-colouring of the edges of F there is a monochromatic subgraph isomorphic to G. Let Mn = min[rc(G): χ(G) = n]. It was conjectured by Burr et al. (1976) that Mn = (n − 1)2 + 1. This conjecture has been confirmed previously for n 4. In this paper, we shall prove that the conjecture is true for n = 5. We shall also improve the upper bounds for M6 and M7. 相似文献
80.
TheInterpolationProblemontheMaximalIdealSpaceofH~∞¥GuoKungu(郭坤宇)(DepartmentofMathematics,SichuanUniversity,Chengdu,610064)Abs?.. 相似文献