全文获取类型
收费全文 | 63篇 |
免费 | 7篇 |
国内免费 | 1篇 |
专业分类
化学 | 13篇 |
力学 | 2篇 |
数学 | 54篇 |
物理学 | 2篇 |
出版年
2020年 | 1篇 |
2019年 | 1篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2016年 | 7篇 |
2015年 | 3篇 |
2014年 | 4篇 |
2013年 | 2篇 |
2012年 | 4篇 |
2011年 | 2篇 |
2010年 | 4篇 |
2009年 | 2篇 |
2008年 | 3篇 |
2007年 | 7篇 |
2006年 | 4篇 |
2005年 | 2篇 |
2004年 | 3篇 |
2003年 | 1篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 6篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1992年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1986年 | 1篇 |
1983年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有71条查询结果,搜索用时 19 毫秒
1.
2.
An explicit coloring of the edges of Kn is constructed such that every copy of K4 has at least four colors on its edges. As n , the number of colors used is n1/2+o(1). This improves upon the previous bound of O(n2/3) due to Erds and Gyárfás obtained by probabilistic methods. The exponent 1/2 is optimal, since it is known that at least (n1/2) colors are required in such a coloring.The coloring is related to constructions giving lower bounds for the multicolor Ramsey number rk(C4). It is more complicated however, because of restrictions imposed on interactions between color classes.* Research supported in part by NSF Grant No. DMS–9970325. 相似文献
3.
Let be graphs. The multicolor Ramsey number is the minimum integer r such that in every edge‐coloring of by k colors, there is a monochromatic copy of in color i for some . In this paper, we investigate the multicolor Ramsey number , determining the asymptotic behavior up to a polylogarithmic factor for almost all ranges of t and m. Several different constructions are used for the lower bounds, including the random graph and explicit graphs built from finite fields. A technique of Alon and Rödl using the probabilistic method and spectral arguments is employed to supply tight lower bounds. A sample result is for any t and m, where c1 and c2 are absolute constants. 相似文献
4.
The effective magnetic moments of a linear chain of up to 12 spin-1/2 particles interacting through the isotropic Heisenberg coupling are computed exactly over the entire temperature range of interest. 相似文献
5.
Dhruv Mubayi 《Advances in Mathematics》2010,225(5):2731-2740
Let F be a graph which contains an edge whose deletion reduces its chromatic number. We prove tight bounds on the number of copies of F in a graph with a prescribed number of vertices and edges. Our results extend those of Simonovits (1968) [8], who proved that there is one copy of F, and of Rademacher, Erd?s (1962) [1] and [2] and Lovász and Simonovits (1983) [4], who proved similar counting results when F is a complete graph.One of the simplest cases of our theorem is the following new result. There is an absolute positive constant c such that if n is sufficiently large and 1?q<cn, then every n vertex graph with ⌊n2/4⌋+q edges contains at least
6.
7.
Ahlswede and Khachatrian [R. Ahlswede, L.H. Khachatrian, The complete nontrivial-intersection theorem for systems of finite sets, J. Combin. Theory Ser. A 76 (1996) 121-138] proved the following theorem, which answered a question of Frankl and Füredi [P. Frankl, Z. Füredi, Nontrivial intersecting families, J. Combin. Theory Ser. A 41 (1986) 150-153]. Let 2?t+1?k?2t+1 and n?(t+1)(k−t+1). Suppose that F is a family of k-subsets of an n-set, every two of which have at least t common elements. If |?F∈FF|<t, then , and this is best possible. We give a new, short proof of this result. The proof in [R. Ahlswede, L.H. Khachatrian, The complete nontrivial-intersection theorem for systems of finite sets, J. Combin. Theory Ser. A 76 (1996) 121-138] requires the entire machinery of the proof of the complete intersection theorem, while our proof uses only ordinary compression and an earlier result of Wilson [R.M. Wilson, The exact bound in the Erd?s-Ko-Rado theorem, Combinatorica 4 (1984) 247-257]. 相似文献
8.
Dhruv Mubayi 《Advances in Mathematics》2007,215(2):601-615
Fix integers n,r?4 and let F denote a family of r-sets of an n-element set. Suppose that for every four distinct A,B,C,D∈F with |A∪B∪C∪D|?2r, we have A∩B∩C∩D≠∅. We prove that for n sufficiently large, , with equality only if ?F∈FF≠∅. This is closely related to a problem of Katona and a result of Frankl and Füredi [P. Frankl, Z. Füredi, A new generalization of the Erd?s-Ko-Rado theorem, Combinatorica 3 (3-4) (1983) 341-349], who proved a similar statement for three sets. It has been conjectured by the author [D. Mubayi, Erd?s-Ko-Rado for three sets, J. Combin. Theory Ser. A, 113 (3) (2006) 547-550] that the same result holds for d sets (instead of just four), where d?r, and for all n?dr/(d−1). This exact result is obtained by first proving a stability result, namely that if |F| is close to then F is close to satisfying ?F∈FF≠∅. The stability theorem is analogous to, and motivated by the fundamental result of Erd?s and Simonovits for graphs. 相似文献
9.
A triangle in a triple system is a collection of three edges isomorphic to {123,124,345}. A triple system is triangle-free if it contains no three edges forming a triangle. It is tripartite if it has a vertex partition into three parts such that every edge has exactly one point in each part. It is easy to see that every tripartite triple system is triangle-free. We prove that almost all triangle-free triple systems with vertex set [n] are tripartite. Our proof uses the hypergraph regularity lemma of Frankl and R?dl [13], and a stability theorem for triangle-free triple systems due to Keevash and the second author [15]. 相似文献
10.
In this paper we show that every simple cubic graph on n vertices has a set of at least ? n/4 ? disjoint 2‐edge paths and that this bound is sharp. Our proof provides a polynomial time algorithm for finding such a set in a simple cubic graph. © 2003 Wiley Periodicals, Inc. J Graph Theory 45: 57–79, 2003 相似文献