首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   34篇
  免费   1篇
化学   8篇
力学   1篇
数学   24篇
物理学   2篇
  2017年   1篇
  2016年   1篇
  2013年   5篇
  2012年   2篇
  2011年   1篇
  2010年   3篇
  2009年   2篇
  2007年   2篇
  2006年   4篇
  2004年   1篇
  2003年   1篇
  2002年   1篇
  1999年   1篇
  1997年   1篇
  1996年   3篇
  1993年   1篇
  1989年   2篇
  1985年   1篇
  1976年   2篇
排序方式: 共有35条查询结果,搜索用时 20 毫秒
1.
LetX be ann-element set and letA and? be families of subsets ofX. We say thatA and? are crosst-intersecting if |A ∩ B| ≥ t holds for all A ∈A and for allB ∈ ?. Suppose thatA and ? are crosst-intersecting. This paper first proves a crosst-intersecting version of Harper's Theorem:
  1. There are two crosst-intersecting Hamming spheresA 0,? 0 with centerX such that |A| ≤ |A 0| and|?| ≤ |? 0| hold.
  2. Suppose thatt ≥ 2 and that the pair of integers (|A) is maximal with respect to direct product ordering among pairs of crosst-intersecting families. Then,A and? are Hamming spheres with centerX.
Using these claims, the following conjecture of Frankl is proven:
  1. Ifn + t = 2k ? 1 then |A| |?| ≤ max \(\left\{ {\left( {K_k^n + \left( {_{k - 1}^{n - 1} } \right)} \right)^2 ,K_k^n K_{k - 1}^n } \right\}\) holds, whereK l n is defined as \(\left( {_n^n } \right)\left( {_{n - 1}^n } \right) + \cdots + \left( {_l^n } \right).\)
  2. Ifn + t = 2k then |A| |? ≤ (K k n )2 holds.
The extremal configurations are also determined.  相似文献   
2.
3.
4.
Let be an n-uniform hypergraph on 2n vertices. Suppose that and holds for all F1,F2,F3 ∈ . We prove that the size of is at most . The second author was supported by MEXT Grant-in-Aid for Scientific Research (B) 16340027  相似文献   
5.
Let n and r be positive integers. Suppose that a family satisfies F1∩···∩Fr ≠∅ for all F1, . . .,Fr ∈ and . We prove that there exists ε=ε(r) >0 such that holds for 1/2≤w≤1/2+ε if r≥13.  相似文献   
6.
7.
We prove that every finite simple graph can be drawn in the plane so that any two vertices have an integral distance if and only if they are adjacent. The proof is constructive.  相似文献   
8.
Let be a k‐uniform hypergraph on n vertices. Suppose that holds for all . We prove that the size of is at most if satisfies and n is sufficiently large. © 2005 Wiley Periodicals, Inc. J Combin Designs  相似文献   
9.
10.
Rheological characteristics of trimethylolethane (TME) clathrate–hydrate slurry treated with drag-reducing surfactants were investigated. Friction coefficients and apparent viscosities were measured when the concentration of TME and its hydrate fraction treated with and without drag-reducing surfactants were changed in several steps. From the results, it is found that the surfactant addition causes effective drag reduction in a pipe flow when the hydrate fraction becomes high, while effective drag reduction disappears in the cases of low hydrate fraction. The results of viscosity measurements indicate that the TME molecules disturb the formation of shear-induced structures (SIS) causing drag reduction phenomena. To investigate this interaction between TME and surfactant micelles, the effect of TME concentration on viscosity and relaxation time of solutions was discussed. From this, it was found out that there exists a critical concentration of TME on the formation of SIS and that it becomes larger as shear rate increases. Thus, we conclude that this interaction between TME and micellar structures causes less drag reduction for the cases of low hydrate fraction, while the drag reduction appears in cases of high hydrate fraction because TME concentration in liquid phase becomes small.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号