Generalized pentagonal geometries. II
In the last decades, many examples of partial linear spaces generalizing classical polygons were introduced, such as generalized quadrangles, generalized hexagons, or near-polygons. A generalized pentagonal geometry \(\mathrm{PENT}(k,r, w)\) is a partial linear space where every line is incident with \(k\) points, every point is incident with \(r\) lines and, for each point \(x\), the set of points not collinear with \(x\) forms the point set of a Steiner system \(S(2, k, w)\) whose blocks are lines of the geometry. While \(w = k\), the structure is called a pentagonal geometry and denoted by \(\mathrm{PENT}(k,r)\). The classical pentagon is a \(\mathrm{PENT}(2, 2)\). The deficiency graph of a \(\mathrm{PENT}(k,r, w)\) has as vertex set the set of points of the geometry, and there is an edge between \(x\) and \(y\) if and only if they are not collinear. In this paper, the authors classify pentagonal geometries according to the properties of their deficiency graphs, and they investigate generalized pentagonal geometries \(\mathrm{PENT}(k,r, w)\) whose deficiency graph has girth 4. Moreover, they present some new constructions of \(\mathrm{PENT}(4,r)\) (e.g. \(\mathrm{PENT}(4,25)\)) and \(\mathrm{PENT}(5,r)\) whose deficiency graphs are connected. They prove that there exist pentagonal geometries \(\mathrm{PENT}(k,r)\) with deficiency graphs of girth at least 5 for \(r\geq13\), \(r \equiv1\pmod4\) when \(k = 4\), and for \(r\geq200000\), \(r\equiv0, 1 \pmod5\) when \(k = 5\). In the last section, the authors define appropriate identifying codes for deficiency graphs of pentagonal geometries. For Part I see [the authors, J. Comb. Des. 30, No. 1, 48--70 (2022; Zbl 1541.05021)].
- A new class of group divisible designs with block size three
- A survey on the existence ofG-Designs
- An alternative way to generalize the pentagon
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- Existence results for pentagonal geometries
- Generalized pentagonal geometries
- Group divisible designs with block size five
- Group divisible designs with block size four and type \(g^um^1\). II
- Group divisible designs with block-size four
- scientific article; zbMATH DE number 5130671 (Why is no real title available?)
- scientific article; zbMATH DE number 1314686 (Why is no real title available?)
- Identifying Codes and Covering Problems
- On a new class of codes for identifying vertices in graphs
- On Moore Graphs with Diameters 2 and 3
- On pentagonal geometries with block size 3, 4 or 5
- On sets of three mols with holes
- Partial linear spaces and identifying codes
- Pentagonal geometries with block sizes 3, 4, and 5
- Some more 5-GDDs, 4-frames and 4-RGDDs
- Sur la trialité et certains groupes qui s'en déduisent
- The CRC handbook of combinatorial designs
- The Existence and Construction of Balanced Incomplete Block Designs
- The nonexistence of certain generalized polygons
This page was built for publication: Generalized pentagonal geometries. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611795)
