首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 125 毫秒
1.
2.
3.
4.
5.
6.
7.
《Discrete Mathematics》2020,343(10):111996
A Gallai coloring of a complete graph Kn is an edge coloring without triangles colored with three different colors. A sequence e1ek of positive integers is an (n,k)-sequence if i=1kei=n2. An (n,k)-sequence is a G-sequence if there is a Gallai coloring of Kn with k colors such that there are ei edges of color i for all i,1ik. Gyárfás, Pálvölgyi, Patkós and Wales proved that for any integer k3 there exists an integer g(k) such that every (n,k)-sequence is a G-sequence if and only if ng(k). They showed that g(3)=5,g(4)=8 and 2k2g(k)8k2+1.We show that g(5)=10 and give almost matching lower and upper bounds for g(k) by showing that with suitable constants α,β>0, αk1.5lnkg(k)βk1.5 for all sufficiently large k.  相似文献   

8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
Minimal blocking sets in PG(2,q2) have size at most q3+1. This result is due to Bruen and Thas and the bound is sharp, sets attaining this bound are called unitals. In this paper, we show that the second largest minimal blocking sets have size at most q3+1(p3)/2, if q=p, p67, or q=ph, p>7, h>1. Our proof also works for sets having at least one tangent at each of its points (that is, for tangency sets).  相似文献   

20.
We look for positive solutions for the singular equation Δu12xu=μh(x)uq1+λu+u(N+2)/(N2),in RN, where N3, λ>0, μ>0 is a parameter, 0<q<1 and h has some summability properties. By using a perturbation method and critical point theory, we obtain two solutions when max{1,N/4}<λ<N/2 and the parameter μ>0 is small.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

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