全文获取类型
| 收费全文 | 142篇 |
| 免费 | 0篇 |
| 国内免费 | 3篇 |
专业分类
| 晶体学 | 1篇 |
| 综合类 | 1篇 |
| 数学 | 140篇 |
| 物理学 | 3篇 |
出版年
| 2024年 | 2篇 |
| 2022年 | 1篇 |
| 2021年 | 5篇 |
| 2020年 | 12篇 |
| 2019年 | 4篇 |
| 2018年 | 8篇 |
| 2017年 | 3篇 |
| 2016年 | 6篇 |
| 2015年 | 10篇 |
| 2014年 | 7篇 |
| 2013年 | 12篇 |
| 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篇 |
排序方式： 共有145条查询结果，搜索用时 15 毫秒
101.
Oliver Cooley Nicola Del Giudice Mihyun Kang Philipp Sprüssel 《Random Structures and Algorithms》2020,56(2):461-500
We consider k‐dimensional random simplicial complexes generated from the binomial random (k + 1)‐uniform hypergraph by taking the downward‐closure. For 1 ≤ j ≤ k ? 1, we determine when all cohomology groups with coefficients in from dimension one up to j vanish and the zero‐th cohomology group is isomorphic to . This property is not deterministically monotone for this model, but nevertheless we show that it has a single sharp threshold. Moreover we prove a hitting time result, relating the vanishing of these cohomology groups to the disappearance of the last minimal obstruction. We also study the asymptotic distribution of the dimension of the j‐th cohomology group inside the critical window. As a corollary, we deduce a hitting time result for a different model of random simplicial complexes introduced by Linial and Meshulam, previously only known for dimension two. 相似文献
102.
We show that every 3‐uniform hypergraph H = (V,E) with |V(H)| = n and minimum pair degree at least (4/5 + o(1))n contains a squared Hamiltonian cycle. This may be regarded as a first step towards a hypergraph version of the Pósa‐Seymour conjecture. 相似文献
103.
The term “hypernetwork” (more precisely, s-hypernetwork and (s, d)-hypernetwork) has been recently adopted to denote some logical structures contained in a directed hypergraph. A hypernetwork identifies the core of a hypergraph model, obtained by filtering off redundant components. Therefore, finding hypernetworks has a notable relevance both from a theoretical and from a computational point of view. 相似文献
104.
Amin Coja‐Oghlan Cristopher Moore Vishal Sanwalani 《Random Structures and Algorithms》2007,31(3):288-329
105.
106.
Anders Yeo 《Journal of Graph Theory》2007,55(4):325-337
A total dominating set, S, in a graph, G, has the property that every vertex in G is adjacent to a vertex in S. The total dominating number, γt(G) of a graph G is the size of a minimum total dominating set in G. Let G be a graph with no component of size one or two and with Δ(G) ≥ 3. In 6 , it was shown that |E(G)| ≤ Δ(G) (|V(G)|–γt(G)) and conjectured that |E(G)| ≤ (Δ(G)+3) (|V(G)|–γt(G))/2 holds. In this article, we prove that holds and that the above conjecture is false as there for every Δ exist Δ‐regular bipartite graphs G with |E(G)| ≥ (Δ+0.1 ln(Δ)) (|V(G)|–γt(G))/2. The last result also disproves a conjecture on domination numbers from 8 . © 2007 Wiley Periodicals, Inc. J Graph Theory 55: 325–337, 2007 相似文献
107.
Wyatt J. Desormeaux Teresa W. Haynes Michael A. Henning Anders Yeo 《Journal of Graph Theory》2014,75(1):91-103
The total domination number of a graph G is the minimum cardinality of a set S of vertices, so that every vertex of G is adjacent to a vertex in S. In this article, we determine an optimal upper bound on the total domination number of a graph with diameter 2. We show that for every graph G on n vertices with diameter 2, . This bound is optimal in the sense that given any , there exist graphs G with diameter 2 of all sufficiently large even orders n such that . 相似文献
108.
Alexandr Kostochka Dhruv Mubayi Jacques Verstraëte 《Random Structures and Algorithms》2014,44(2):224-239
The independence number of a hypergraph H is the size of a largest set of vertices containing no edge of H. In this paper, we prove that if Hn is an n‐vertex ‐uniform hypergraph in which every r‐element set is contained in at most d edges, where , then where satisfies as . The value of cr improves and generalizes several earlier results that all use a theorem of Ajtai, Komlós, Pintz, Spencer and Szemerédi (J Comb Theory Ser A 32 (1982), 321–335). Our relatively short proof extends a method due to Shearer (Random Struct Algorithms 7 (1995), 269–271) and Alon (Random Struct Algorithms 9 (1996), 271–278). The above statement is close to best possible, in the sense that for each and all values of , there are infinitely many Hn such that where depends only on r. In addition, for many values of d we show as , so the result is almost sharp for large r. We give an application to hypergraph Ramsey numbers involving independent neighborhoods.Copyright © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 44, 224‐239, 2014 相似文献
109.
Let be drawn uniformly from all m‐edge, k‐uniform, k‐partite hypergraphs where each part of the partition is a disjoint copy of . We let be an edge colored version, where we color each edge randomly from one of colors. We show that if and where K is sufficiently large then w.h.p. there is a rainbow colored perfect matching. I.e. a perfect matching in which every edge has a different color. We also show that if n is even and where K is sufficiently large then w.h.p. there is a rainbow colored Hamilton cycle in . Here denotes a random edge coloring of with n colors. When n is odd, our proof requires for there to be a rainbow Hamilton cycle. © 2015 Wiley Periodicals, Inc. Random Struct. Alg., 48, 503–523, 2016 相似文献
110.
We show that, for a natural notion of quasirandomness in k‐uniform hypergraphs, any quasirandom k‐uniform hypergraph on n vertices with constant edge density and minimum vertex degree Ω(nk‐1) contains a loose Hamilton cycle. We also give a construction to show that a k‐uniform hypergraph satisfying these conditions need not contain a Hamilton ?‐cycle if k– ? divides k. The remaining values of ? form an interesting open question. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 49, 363–378, 2016 相似文献