全文获取类型
收费全文 | 156篇 |
免费 | 2篇 |
专业分类
化学 | 49篇 |
力学 | 1篇 |
数学 | 73篇 |
物理学 | 35篇 |
出版年
2021年 | 4篇 |
2020年 | 5篇 |
2019年 | 5篇 |
2018年 | 3篇 |
2016年 | 3篇 |
2015年 | 3篇 |
2013年 | 4篇 |
2012年 | 9篇 |
2011年 | 4篇 |
2010年 | 3篇 |
2009年 | 2篇 |
2008年 | 5篇 |
2007年 | 2篇 |
2005年 | 2篇 |
2004年 | 2篇 |
2003年 | 2篇 |
2002年 | 3篇 |
2000年 | 3篇 |
1999年 | 2篇 |
1998年 | 3篇 |
1997年 | 4篇 |
1992年 | 1篇 |
1991年 | 3篇 |
1987年 | 1篇 |
1985年 | 1篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1975年 | 8篇 |
1974年 | 5篇 |
1973年 | 7篇 |
1972年 | 2篇 |
1971年 | 2篇 |
1970年 | 2篇 |
1969年 | 3篇 |
1968年 | 1篇 |
1967年 | 1篇 |
1966年 | 2篇 |
1965年 | 1篇 |
1963年 | 3篇 |
1962年 | 1篇 |
1961年 | 2篇 |
1960年 | 1篇 |
1958年 | 1篇 |
排序方式: 共有158条查询结果,搜索用时 15 毫秒
121.
122.
123.
The paper deals with common generalizations of classical results of Ramsey and Turán. The following is one of the main results. Assumek≧2, ε>0,G n is a sequence of graphs ofn-vertices and at least 1/2((3k?5) / (3k?2)+ε)n 2 edges, and the size of the largest independent set inG n iso(n). LetH be any graph of arboricity at mostk. Then there exists ann 0 such that allG n withn>n 0 contain a copy ofH. This result is best possible in caseH=K 2k . 相似文献
124.
125.
126.
A. Hajnal 《Combinatorica》1985,5(2):137-139
We prove (in ZFC) that for every infinite cardinal ϰ there are two graphsG
0,G
1 with χ(G
0)=χ(G
1)=ϰ+ and χ(G
0×G
1)=ϰ. We also prove a result from the other direction. If χ(G
0)≧≧ℵ0 and χ(G
1)=k<ω, then χ(G
0×G
1)=k. 相似文献
127.
We discuss some new properties of the natural Galois connection among set relation algebras, permutation groups, and first order logic. In particular, we exhibit infinitely many permutational relation algebras without a Galois closed representation, and we also show that every relation algebra on a set with at most six elements is Galois closed and essentially unique. Thus, we obtain the surprising result that on such sets, logic with three variables is as powerful in expression as full first order logic. 相似文献
128.
It is consistent that there is an order type for which
holds for every type .Research partially supported by Hungarian National Science Grant OTKA 016391.Partially supported by the European Communities (Cooperation in Science and Technology with Central and Eastern European Countries) contract number ERBCIPACT930113. 相似文献
129.
We consider local partial clones defined on an uncountable set E having the form Polp(\({\mathfrak{R}}\)), where \({\mathfrak{R}}\) is a set of relations on E. We investigate the notion of weak extendability of partial clones of the type Polp(\({\mathfrak{R}}\)) (in the case of E countable, this coincides with the notion of extendability previously introduced by the author in 1987) which allows us to expand to uncountable sets results on the characterization of Galois-closed sets of relations as well as model-theoretical properties of a relational structure \({\mathfrak{R}}\). We establish criteria for positive primitive elimination sets (sets of positive primitive formulas over \({\mathfrak{R}}\) through which any positive primitive definable relation over \({\mathfrak{R}}\) can be expressed without existential quantifiers) for finite \({\mathfrak{R}}\) as well as for \({\mathfrak{R}}\) having only finite number of positive primitive definable relations of any arity. Emphasizing the difference between countable and uncountable sets, we show that, unlike in the countable case, the characterization of Galois-closed sets InvPol(\({\mathfrak{R}}\)) (that is, all relations which are invariant under all operations from the clone Pol(\({\mathfrak{R}}\)) defined on an uncountable set) cannot be obtained via the application of finite positive primitive formulas together with infinite intersections and unions of updirected sets of relations from \({\mathfrak{R}}\). 相似文献
130.
G andH, two simple graphs, can be packed ifG is isomorphic to a subgraph of
, the complement ofH. A theorem of Catlin, Spencer and Sauer gives a sufficient condition for the existence of packing in terms of the product of the maximal degrees ofG andH. We improve this theorem for bipartite graphs. Our condition involves products of a maximum degree with an average degree. Our relaxed condition still guarantees a packing of the two bipartite graphs.the paper was written while the authors were graduate students at the University of Chicago and was completed while the first author was at M.I.T. The work of the first author was supported in part by the Air Force under Contract OSR-86-0076 and by DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center-NSF-STC88-09648. The work of the second author was supported in part by NSF grant CCR-8706518. 相似文献