Counting configurations in designs

DOI10.1006/jcta.2001.3185zbMath1001.51003OpenAlexW2017208859MaRDI QIDQ5953380

Robert A. Beezer

Publication date: 11 March 2002

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f77abf3297fe5456939e988f1c8bc7e2d04d1640

zbMATH Keywords

configurationsdesigns

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Steiner systems in finite geometry (51E10) Triple systems (05B07) General block designs in finite geometry (51E05)

Related Items (3)

Algorithms and complexity for counting configurations in Steiner triple systems ⋮ Bussey systems and Steiner's tactical problem ⋮ The \(L\)-functions and Modular Forms Database project

Uses Software

• nauty

Cites Work

• Some results on quadrilaterals in Steiner triple systems
• Anti-mitre Steiner triple systems
• The matching polynomial of a regular graph
• A small basis for four‐line configurations in steiner triple systems. Dedicated to the memory of gemma holly griggs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting configurations in designs