In this paper we denote byP(3)(2,5) a path-hypergraph of rank 3and length 3 whose vertices are{a, b, c, d, e}and edges{a, b, c},{b, c, d}and{c, d, e}. We give iterative constructions ofP(3)(2,5)-designs ofany index, determining the complete spectrum of such designs, and thespectrum of simply and strongly balancedP(3)(2,5)-designs. In the lastsection we will consider the embeddings of path-designs inP(3)(2,5)-designs.
On a 3-uniform path-hypergraph on 5 vertices
BONACINI, PAOLA
2016-01-01
Abstract
In this paper we denote byP(3)(2,5) a path-hypergraph of rank 3and length 3 whose vertices are{a, b, c, d, e}and edges{a, b, c},{b, c, d}and{c, d, e}. We give iterative constructions ofP(3)(2,5)-designs ofany index, determining the complete spectrum of such designs, and thespectrum of simply and strongly balancedP(3)(2,5)-designs. In the lastsection we will consider the embeddings of path-designs inP(3)(2,5)-designs.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
bonaciniAMS29-32-2016.pdf
solo gestori archivio
Tipologia:
Versione Editoriale (PDF)
Licenza:
Creative commons
Dimensione
229.46 kB
Formato
Adobe PDF
|
229.46 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
