Survey on balanced graph and hypergraph designs

DOI10.4418/2024.79.2.11MaRDI QIDQ7033398zbMATH OpenFDO

Authors Paola Bonacini, Mario Gionfriddo, Lucia Marino

Publication date 3 February 2025

Published in Le Matematiche (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4418/2024.79.2.11

zbMATH Keywords

\(G\)-designbalancedlocally balanced

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Graph designs and isomorphic decomposition (05C51)

Cites work

• scientific article; zbMATH DE number 3710227 (Why is no real title available?)
• scientific article; zbMATH DE number 3428942 (Why is no real title available?)
• scientific article; zbMATH DE number 3308125 (Why is no real title available?)
• Balanced House-systems and nestings.
• Balanced \(P^{(3)} (2, 4)\)-designs
• Balanced and strongly balanced 4-kite designs
• Balanced and strongly balanced \(P_k\)-designs
• Cycle decompositions of K_n and K_n-I
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Degree- and orbit-balanced -designs when has five vertices
• Edge balanced star‐hypergraph designs and vertex colorings of path designs
• Further results concerning the existence of handcuffed designs
• Graph decompositions, handcuffed prisoners and balanced p-designs
• Handcuffed designs
• Handcuffed designs
• On the construction of handcuffed designs
• On the existence of balanced bipartite designs. II
• Some techniques for the construction of hyperpath-designs -- a survey
• The CRC handbook of combinatorial designs
• The spectrum of balanced \(P^{(3)}(1, 5)\)-designs
• Tree-designs with balanced-type conditions
• \(G\)-decomposition of \(K_n\), where G has four vertices or less

This page was built for publication: Survey on balanced graph and hypergraph designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033398)