全文获取类型
收费全文 | 115篇 |
免费 | 22篇 |
国内免费 | 5篇 |
专业分类
综合类 | 1篇 |
数学 | 138篇 |
物理学 | 3篇 |
出版年
2022年 | 1篇 |
2021年 | 5篇 |
2020年 | 12篇 |
2019年 | 4篇 |
2018年 | 8篇 |
2017年 | 3篇 |
2016年 | 6篇 |
2015年 | 10篇 |
2014年 | 7篇 |
2013年 | 11篇 |
2012年 | 7篇 |
2011年 | 7篇 |
2010年 | 2篇 |
2009年 | 4篇 |
2008年 | 9篇 |
2007年 | 8篇 |
2006年 | 12篇 |
2004年 | 5篇 |
2003年 | 5篇 |
2002年 | 1篇 |
2001年 | 2篇 |
2000年 | 4篇 |
1999年 | 3篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1991年 | 1篇 |
排序方式: 共有142条查询结果,搜索用时 15 毫秒
1.
2.
3.
主要讨论了不含k-C-圈的n阶r-一致超图,对不同的k,分别得出了它的极大边数的一个下界,并且得出在有些情况下它的下界是最大的.另外,我们得到了Krn含k-C-圈的一个充分必要条件. 相似文献
4.
For every ?>0 and every positive integers Δ and r, there exists C=C(?,Δ,r) such that the Ramsey number, R(H,H) of any r-uniform hypergraph H with maximum degree at most Δ is at most C|V(H)|1+?. 相似文献
5.
Daniel Král’ Jan Kratochvíl Andrzej Proskurowski Heinz-Jürgen Voss 《Discrete Applied Mathematics》2006,154(4):660-672
A mixed hypergraph is a triple (V,C,D) where V is its vertex set and C and D are families of subsets of V, called C-edges and D-edges, respectively. For a proper coloring, we require that each C-edge contains two vertices with the same color and each D-edge contains two vertices with different colors. The feasible set of a mixed hypergraph is the set of all k's for which there exists a proper coloring using exactly k colors. A hypergraph is a hypertree if there exists a tree such that the edges of the hypergraph induce connected subgraphs of the tree.We prove that feasible sets of mixed hypertrees are gap-free, i.e., intervals of integers, and we show that this is not true for precolored mixed hypertrees. The problem to decide whether a mixed hypertree can be colored by k colors is NP-complete in general; we investigate complexity of various restrictions of this problem and we characterize their complexity in most of the cases. 相似文献
6.
7.
Natural selection acts on genetic variation that comes from two principal sources: mutation and recombination. Because of the inherent differences between mutation and recombination, it is often assumed that they are qualitatively different ways to explore the genotype space. In this paper a new way of constructing recombination spaces is introduced and the topological features of the resulting hypergraphs are analyzed. It is shown that types which are neighbors in the point mutation space are also neighbors in the recombination space, i.e., mutation and recombination spaces are homomorphic. This implies that the shapes of the fitness functions explored by mutation and recombination are similar. However, the potential of one- and two-point recombination operators to explore the fitness landscape may differ dramatically from uniform recombination operators or mutation operators because of the limited number of recombinant types they can produce. © 1996 John Wiley & Sons, Inc. 相似文献
8.
9.
We solve a problem proposed by Jacobson, Kézdy, and Lehel [4] concerning the existence of forbidden induced subgraph characterizations of line graphs of linear k-uniform hypergraphs with sufficiently large minimal edge-degree. Actually, we prove that for each k3 there is a finite set Z(k) of graphs such that each graph G with minimum edge-degree at least 2k2–3k+1 is the line graph of a linear k-uniform hypergraph if and only if G is a Z(k)-free graph.Acknowledgments. We thank the anonymous referees, whose suggestions helped to improve the presentation of the paper.Winter 2002/2003 DIMACS Award is gratefully acknowledged2000 Mathematics Subject Classification: 05C65 (05C75, 05C85) 相似文献
10.
郑国彪 《纯粹数学与应用数学》2011,27(3):308-312
混合超图的上,下色数与C-超边和D-超边数有着必然联系.一般地,增加C边会使下色数x(H)增加,增加D-超边会使上色数(x)(H)减小.本论文对D-完全一致混合超图进行研究,利用组合数学中分划思想及方法得到的D-完全一致混合超图不可着色的一个充要条件,对D-完全一致混合超图能否着色找到了可行的依据,进一步揭示C-超边数... 相似文献