Survey on balanced graph and hypergraph designs
Abstract
In this paper we recall some results on balanced type conditions for graph and hypergraph designs. The usual definition of balanced graph design (see [23]) is the following: a G-design is balanced if the number of blocks containing any vertex is constant. Later, other balanced type conditions have been introduced for graph designs and extended to hypergraph designs. In the latter case the new notion of edge balanced has been introduced, being related to the number of times that a pair is contained in an edge of a block.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 P. Bonacini, M. Gionfriddo, L. Marino
This work is licensed under a Creative Commons Attribution 4.0 International License.
The authors retain all rights to the original work without any restrictions.
License for Published Contents
"Le Matematiche" published articlesa are distribuited with Creative Commons Attribution 4.0 International. You are free to copy, distribute and transmit the work, and to adapt the work. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
License for Metadata
"Le Matematiche" published articles metadata are dedicated to the public domain by waiving all publisher's rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law.
You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
No Fee Charging
No fee is required to complete the submission/review/publishing process of authors paper.
