共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
For bipartite graphs , the bipartite Ramsey number is the least positive integer so that any coloring of the edges of with colors will result in a copy of in the th color for some . In this paper, our main focus will be to bound the following numbers: and for all for and for Furthermore, we will also show that these mentioned bounds are generally better than the bounds obtained by using the best known Zarankiewicz-type result. 相似文献
4.
Weighted pseudo-almost periodic solutions of a class of semilinear fractional differential equations
Ravi P. Agarwal Bruno de Andrade Claudio Cuevas 《Nonlinear Analysis: Real World Applications》2010,11(5):3532-3554
We study the existence and uniqueness of a weighted pseudo-almost periodic (mild) solution to the semilinear fractional equation , , where is a linear operator of sectorial negative type. This article also deals with the existence of these types of solutions to abstract partial evolution equations. 相似文献
5.
6.
《Nonlinear Analysis: Hybrid Systems》2007,1(1):124-134
Convolution complementarity problems have the form: given a kernel function and a function , find a function such that , for (almost) all , and where . A fractional index problem of this kind has for small, with . Such problems are shown to have unique solutions under mild conditions. 相似文献
7.
In this paper, we show that for any fixed integers and , the star-critical Ramsey number for all sufficiently large . Furthermore, for any fixed integers and , as . 相似文献
8.
This paper considers a degree sum condition sufficient to imply the existence of vertex-disjoint cycles in a graph . For an integer , let be the smallest sum of degrees of independent vertices of . We prove that if has order at least and , with , then contains vertex-disjoint cycles. We also show that the degree sum condition on is sharp and conjecture a degree sum condition on sufficient to imply contains vertex-disjoint cycles for . 相似文献
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
Denis S. Krotov 《Discrete Mathematics》2017,340(12):2723-2731
A subspace bitrade of type is a pair of two disjoint nonempty collections of -dimensional subspaces of a -dimensional space over the finite field of order such that every -dimensional subspace of is covered by the same number of subspaces from and . In a previous paper, the minimum cardinality of a subspace bitrade was established. We generalize that result by showing that for admissible , , and , the minimum cardinality of a subspace bitrade does not depend on . An example of a minimum bitrade is represented using generator matrices in the reduced echelon form. For , the uniqueness of a minimum bitrade is proved. 相似文献