Cycles in the block-intersection graph of pairwise balanced designs (Q1343785): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q210144 |
Created claim: Wikidata QID (P12): Q127976873, #quickstatements; #temporary_batch_1722235777118 |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Brian Alspach / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Edge-pancyclic block-intersection graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3487379 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4873796 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3137967 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q127976873 / rank | |||
Normal rank |
Latest revision as of 08:51, 29 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cycles in the block-intersection graph of pairwise balanced designs |
scientific article |
Statements
Cycles in the block-intersection graph of pairwise balanced designs (English)
0 references
6 February 1995
0 references
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.
0 references
block design
0 references
pairwise balanced design
0 references
block-intersection graph
0 references
edge- pancyclic
0 references