Cycles in the block-intersection graph of pairwise balanced designs

DOI10.1016/0012-365X(93)E0140-YMaRDI QIDQ1343785zbMATH OpenWikidataFDO

Authors Donovan R. Hare

Publication date 6 February 1995

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(93)E0140-Y

zbMATH Keywords

block designblock-intersection graphedge- pancyclicpairwise balanced design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Paths and cycles (05C38)

Review text

Let \(K\) be a set of positive integers, and let \(\lambda\) and \(v\) be positive integers so that \(v\) is greater than the largest integer belonging to \(K\). A pairwise balanced design \(\text{PBD}(v,K, \lambda)\) is a collection of subsets (called blocks) of a \(v\)-set \(V\) such that every block has cardinality equal to an integer in \(K\) and every pair of distinct elements of \(V\) lies in precisely \(\lambda\) blocks. The block- intersection graph of a pairwise balanced design is obtained by letting the vertices correspond to the blocks and defining two vertices to be adjacent if and only if the corresponding blocks have non-empty intersection. A graph \(G\) is said to be edge-pancyclic if every edge of \(G\) is contained in a cycle of each length \(\ell\) satisfying \(3\leq\ell\leq n\), where \(n\) is the order of \(G\). The author proves that the block-intersection graph of any pairwise balanced design with \(\lambda= 1\) and no blocks having two or fewer elements is edge- pancyclic.

Recommendations

• Pancyclic PBD block-intersection graphs
• Pancyclic BIBD block-intersection graphs
• Cycle extensions in PBD block-intersection graphs.
• Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs
• scientific article; zbMATH DE number 4160773

Cites work

• Edge-pancyclic block-intersection graphs
• scientific article; zbMATH DE number 431053 (Why is no real title available?)
• scientific article; zbMATH DE number 4160773 (Why is no real title available?)
• scientific article; zbMATH DE number 867683 (Why is no real title available?)

Cited in

(17)

• Hamiltonicity and restricted block-intersection graphs of t-designs
• Balanced directed cycle designs based on groups
• The connectivity of the block-intersection graphs of designs
• The set of values of \(b\) for which there exist block designs with \(b\) blocks
• Pancyclic BIBD block-intersection graphs
• Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs
• Pancyclic PBD block-intersection graphs
• Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs
• Cycle extensions in BIBD block-intersection graphs
• Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
• scientific article; zbMATH DE number 4160773 (Why is no real title available?)
• Silver block intersection graphs of Steiner 2-designs
• scientific article; zbMATH DE number 4055624 (Why is no real title available?)
• Cycle extensions in PBD block-intersection graphs.
• scientific article; zbMATH DE number 5202625 (Why is no real title available?)
• Hamilton cycles in restricted block-intersection graphs
• Spanning Euler tours in hypergraphs

This page was built for publication: Cycles in the block-intersection graph of pairwise balanced designs

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