首页 | 本学科首页   官方微博 | 高级检索  
     


The 2‐Blocking Number and the Upper Chromatic Number of PG(2,q)
Authors:Gábor Bacsó  Tamás Héger  Tamás Szőnyi
Affiliation:1. Computer and Automation Institute, Hungarian Academy of Sciences, , H‐1111 Budapest, Kende u. 13‐17, Hungary;2. Department of Computer Science, E?tv?s Loránd University, , H‐1117 Budapest, Pázmány P. sétány 1/C, Hungary
Abstract:A twofold blocking set (double blocking set) in a finite projective plane Π is a set of points, intersecting every line in at least two points. The minimum number of points in a double blocking set of Π is denoted by τ2(Π). Let PG(2,q) be the Desarguesian projective plane over GF(q), the finite field of q elements. We show that if q is odd, not a prime, and r is the order of the largest proper subfield of GF(q), then τ2PG(2,q))≤ 2(q+(q‐1)/(r‐1)). For a finite projective plane Π, let urn:x-wiley:10638539:media:jcd21347:jcd21347-math-0001 denote the maximum number of classes in a partition of the point‐set, such that each line has at least two points in some partition class. It can easily be seen that urn:x-wiley:10638539:media:jcd21347:jcd21347-math-0002 (?) for every plane Π on v points. Let urn:x-wiley:10638539:media:jcd21347:jcd21347-math-0003, p prime. We prove that for urn:x-wiley:10638539:media:jcd21347:jcd21347-math-0004, equality holds in (?) if q and p are large enough.
Keywords:hypergraph  finite projective plane  upper chromatic number  double blocking set  MSC2000 Subject Classification: 05C15  05B25
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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