Notes on well-distributed minimal sub-BIBDs for \lambda=1

MaRDI QIDQ6299687zbMATH OpenFDO

Authors Daniele Dona

Publication date 28 March 2018

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Steiner systems in finite geometry (51E10)

Abstract: In these notes we investigate BIBDs with $lambda=1$ that present subdesigns evenly covering both blocks and vertices: we determine some of their basic properties, consequence of already existing results in the literature, with regards to their size and the number of intersections of pairs and triples of subdesigns of a specific kind. We also describe the link between these particular BIBDs and the graph isomorphism problem, based on Babai's paper, and point out the characteristics of these designs that would lead to improvements of the algorithm for the GIP.

This page was built for publication: Notes on well-distributed minimal sub-BIBDs for $\lambda=1$

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