The 2‐Blocking Number and the Upper Chromatic Number of PG(2,q)
From MaRDI portal
Publication:5411948
DOI10.1002/jcd.21347zbMath1286.05043OpenAlexW1838523206MaRDI QIDQ5411948
Gábor Bacsó, Tamás Szőnyi, Tamás Héger
Publication date: 25 April 2014
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.21347
Hypergraphs (05C65) Combinatorial aspects of finite geometries (05B25) Coloring of graphs and hypergraphs (05C15)
Related Items (8)
Blocking and double blocking sets in finite planes ⋮ Double blocking sets of size \(3 q - 1\) in \(\operatorname{PG}(2, q)\) ⋮ On the upper chromatic number and multiple blocking sets of PG(n,q) ⋮ On the balanced upper chromatic number of finite projective planes ⋮ Search problems in vector spaces ⋮ Mixed hypergraphs and beyond ⋮ On the balanced upper chromatic number of cyclic projective planes and projective spaces ⋮ New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
Cites Work
- Unnamed Item
- Linear nonbinary covering codes and saturating sets in projective spaces
- Linear sets in finite projective spaces
- A geometric construction of finite semifields
- Polynomial multiplicities over finite fields and intersection sets
- Blocking sets in Desarguesian affine and projective planes
- On the size of a double blocking set in \(\text{PG}(2,q)\)
- Unique reducibility of multiple blocking sets
- Upper chromatic number of finite projective planes
- Lacunary Polynomials, Multiple Blocking Sets and Baer Subplanes
- Rainbow coloring the cube
- Multiple Blocking Sets and Arcs in Finite Planes
- On multiple blocking sets in Galois planes
- Note on disjoint blocking sets in Galois planes
This page was built for publication: The 2‐Blocking Number and the Upper Chromatic Number of PG(2,q)