On the upper chromatic number and multiple blocking sets of PG(n,q)

DOI10.1002/jcd.21686arXiv1909.02867OpenAlexW2983998951WikidataQ126814610 ScholiaQ126814610MaRDI QIDQ6185553

Zoltán L. Blázsik, Tamás Szőnyi, Tamás Héger

Publication date: 29 January 2024

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.02867

zbMATH Keywords

projective spacesupper chromatic numbermultiple weigthed blocking sets

Mathematics Subject Classification ID

Hypergraphs (05C65) Blocking sets, ovals, (k)-arcs (51E21) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Blocking and double blocking sets in finite planes
• On the size of a blocking set in \(\text{PG}(2,p)\)
• Coloring mixed hypergraphs: theory, algorithms and applications
• Unique reducibility of multiple blocking sets
• Parameters for which the Griesmer bound is not sharp
• Linear representations of projective planes in projective spaces
• The construction of translation planes from projective spaces
• Über nicht-Desarguessche Ebenen mit transitiver Translationsgruppe
• The 2‐Blocking Number and the Upper Chromatic Number of PG(2,q)
• Blocking Sets in Finite Projective Planes

This page was built for publication: On the upper chromatic number and multiple blocking sets of PG(n,q)