Miroslava Cimráková ; Veerle Fack - On minimal blocking sets of the generalized quadrangle Q(4,q)

dmtcs:3466 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) - https://doi.org/10.46298/dmtcs.3466
On minimal blocking sets of the generalized quadrangle Q(4,q)Conference paper

Authors: Miroslava Cimráková 1; Veerle Fack 1

  • 1 Research Group on Combinatorial Algorithms and Algorithmic Graph Theory

The generalized quadrangle Q(4,q) arising from the parabolic quadric in PG(4,q) always has an ovoid. It is not known whether a minimal blocking set of size smaller than q2+q (which is not an ovoid) exists in Q(4,q), q odd. We present results on smallest blocking sets in Q(4,q), q odd, obtained by a computer search. For q=5,7,9,11 we found minimal blocking sets of size q2+q2 and we discuss their structure. By an exhaustive search we excluded the existence of a minimal blocking set of size q2+3 in Q(4,7).


Volume: DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: generalized quadrangle,blocking set,search algorithm,[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Consultation statistics

This page has been seen 245 times.
This article's PDF has been downloaded 220 times.