Hamilton decompositions of block-intersection graphs of Steiner triple systems (Q2761052)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1682914
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamilton decompositions of block-intersection graphs of Steiner triple systems |
scientific article; zbMATH DE number 1682914 |
Statements
17 December 2001
0 references
Steiner triple system
0 references
block-intersection graph
0 references
Hamilton decomposition
0 references
0.9287762
0 references
0.9034236
0 references
0.8952937
0 references
0.8945607
0 references
0.8893739
0 references
0.88759375
0 references
Hamilton decompositions of block-intersection graphs of Steiner triple systems (English)
0 references
Connect two triples of a Steiner triple system (STS) by an edge if they intersect. This is the block-intersection graph, and for STSs of order \(n\geq 19\) the author easily proves that an isomorphism of these graphs implies an isomorphism of the STSs (cliques of size \((n-1)/2\) identify points). The same result holds also for \(n\leq 15\), where some of the more difficult cases were proved with the help of computer. A computer was also used to verify that for \(n\leq 15\) block-intersection graphs of STSs are Hamilton decomposable.
0 references
