### Abstract

Assign positive integer weights to the edges of a hypergraph in such a way that summing up the weights of the edges through a point yields distinct integers for different points. In this note we give a lower bound for the maximal edgeweight in case the hypergraph is uniform and regular, i.e. it is a 1-design. If the hypergraph is the dual of a 2-(v,k,λ) design then this bound specializes to [b(b ^{2} -1)] [3v(r-λ)]. In particular for a projective plane this number is at least q q 3.

Original language | English |
---|---|

Pages (from-to) | 339-343 |

Number of pages | 5 |

Journal | Discrete Mathematics |

Volume | 131 |

Issue number | 1-3 |

DOIs | |

Publication status | Published - Aug 5 1994 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'Irregular weighting of 1-designs'. Together they form a unique fingerprint.

## Cite this

Blokhuis, A., & Szőnyi, T. (1994). Irregular weighting of 1-designs.

*Discrete Mathematics*,*131*(1-3), 339-343. https://doi.org/10.1016/0012-365X(94)90395-6