全文获取类型
收费全文 | 172篇 |
免费 | 39篇 |
国内免费 | 11篇 |
专业分类
化学 | 1篇 |
综合类 | 1篇 |
数学 | 214篇 |
物理学 | 6篇 |
出版年
2024年 | 1篇 |
2023年 | 10篇 |
2022年 | 6篇 |
2021年 | 9篇 |
2020年 | 16篇 |
2019年 | 12篇 |
2018年 | 17篇 |
2017年 | 9篇 |
2016年 | 12篇 |
2015年 | 10篇 |
2014年 | 7篇 |
2013年 | 10篇 |
2012年 | 5篇 |
2011年 | 11篇 |
2010年 | 12篇 |
2009年 | 13篇 |
2008年 | 11篇 |
2007年 | 7篇 |
2006年 | 8篇 |
2005年 | 6篇 |
2004年 | 2篇 |
2003年 | 5篇 |
2002年 | 3篇 |
2001年 | 6篇 |
2000年 | 3篇 |
1999年 | 5篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1993年 | 1篇 |
1990年 | 1篇 |
1985年 | 1篇 |
1983年 | 1篇 |
排序方式: 共有222条查询结果,搜索用时 15 毫秒
1.
Csilla Bujtás 《Discrete Applied Mathematics》2007,155(11):1395-1407
For a mixed hypergraph H=(X,C,D), where C and D are set systems over the vertex set X, a coloring is a partition of X into ‘color classes’ such that every C∈C meets some class in more than one vertex, and every D∈D has a nonempty intersection with at least two classes. A vertex-orderx1,x2,…,xn on X (n=|X|) is uniquely colorable if the subhypergraph induced by {xj:1?j?i} has precisely one coloring, for each i (1?i?n). We prove that it is NP-complete to decide whether a mixed hypergraph admits a uniquely colorable vertex-order, even if the input is restricted to have just one coloring. On the other hand, via a characterization theorem it can be decided in linear time whether a given color-sequence belongs to a mixed hypergraph in which the uniquely colorable vertex-order is unique. 相似文献
2.
A set of vertices is shattered in a hypergraph if any of its subsets is obtained as the intersection of an edge with the set. The VC dimension is the size of the largest shattered subset. Under the binomial model of k‐uniform random hypergraphs, the threshold function for the VC dimension to be larger than a given integer is obtained. The same is done for the testing dimension, which is the largest integer d such that all sets of cardinality d are shattered. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007 相似文献
3.
主要讨论了不含k-C-圈的n阶r-一致超图,对不同的k,分别得出了它的极大边数的一个下界,并且得出在有些情况下它的下界是最大的.另外,我们得到了Krn含k-C-圈的一个充分必要条件. 相似文献
4.
《Discrete Mathematics》2022,345(6):112832
An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the signed graphic frame matroid to any oriented hypergraphic incidence matrix via its locally-signed-graphic substructure. To achieve this, Camion's algorithm is applied to oriented hypergraphs to provide a generalization of reorientation sets and frustration that is only well-defined on balanceable oriented hypergraphs. A simple partial characterization of unbalanceable circuits extends the applications to representable matroids demonstrating that the difference between the Fano and non-Fano matroids is one of balance. 相似文献
5.
在合作博弈的一般模型中总是假设所有联盟都能形成。不过,在实际中由于受到一些因素的制约,有些联盟是不能形成的。基于此,Myerson提出了具有图通讯结构的合作博弈。Myerson值和Position值是超图博弈上的两个重要分配规则。2005年,Slikker给出了在图博弈上Position值的公理化刻画。但超图博弈上Position值的公理化刻画一直悬而未决。本文通过引入“赋权平衡超边贡献公理”,并结合经典的“分支有效性”,提出了超图博弈上赋权Position值的公理化刻画。作为推论,解决了超图博弈上Position值的公理化刻画问题。 相似文献
6.
7.
In this paper, we are interested in the following question: given an arbitrary Steiner triple system on vertices and any 3‐uniform hypertree on vertices, is it necessary that contains as a subgraph provided ? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive. 相似文献
8.
9.
Linh V. Tran 《Random Structures and Algorithms》2011,38(3):365-380
Consider a set of n random axis parallel boxes in the unit hypercube in ${\bf R}^{d}$ , where d is fixed and n tends to infinity. We show that the minimum number of points one needs to pierce all these boxes is, with high probability, at least $\Omega_d(\sqrt{n}(\log n)^{d/2-1})$ and at most $O_d(\sqrt{n}(\log n)^{d/2-1}\log \log n)$ . © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 38, 365–380, 2011 相似文献
10.