On the Size of a Maximum Transversal in a Steiner Triple System

DOI10.4153/CJM-1981-090-7zbMath0481.05016OpenAlexW2160148808MaRDI QIDQ3937418

Andries E. Brouwer

Publication date: 1981

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1981-090-7

zbMATH Keywords

Steiner quadruple systemspartial parallel classmaximum transversal

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Permutations, words, matrices (05A05) Triple systems (05B07)

Related Items

New bounds for Ryser’s conjecture and related problems, Nearly perfect matchings in regular simple hypergraphs, On partial parallel classes in partial Steiner triple systems, Graph and hypergraph colouring via nibble methods: a survey, New bounds on the size of nearly perfect matchings in almost regular hypergraphs, On the minimum number of blocks of a maximal partial spread in STS(v) and SQS(v), Spanning trees of 3-uniform hypergraphs, Parallelism in Steiner systems, Matchings and covers in hypergraphs, Asymptotic behavior of the chromatic index for hypergraphs