In this paper some properties of k-chromatic and strong k-chromatic hypergraphs are proved. Conditions for the possible existence of blocking sets in Steiner systems are established.

Uniform coloured hypergraphs and Blocking sets

GIONFRIDDO, Mario;MILAZZO, Lorenzo Maria Filippo
2013

Abstract

In this paper some properties of k-chromatic and strong k-chromatic hypergraphs are proved. Conditions for the possible existence of blocking sets in Steiner systems are established.
Colourings, Chromatic number, Blocking set
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/20.500.11769/14530
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? ND
social impact