Counting configurations in designs
From MaRDI portal
Publication:5953380
DOI10.1006/JCTA.2001.3185zbMATH Open1001.51003OpenAlexW2017208859MaRDI QIDQ5953380FDOQ5953380
Authors: 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
Recommendations
Combinatorial aspects of block designs (05B05) Steiner systems in finite geometry (51E10) Triple systems (05B07) General block designs in finite geometry (51E05)
Cites Work
- The matching polynomial of a regular graph
- Anti-mitre Steiner triple systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some results on quadrilaterals in Steiner triple systems
- A small basis for four‐line configurations in steiner triple systems. Dedicated to the memory of gemma holly griggs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Algorithms and complexity for counting configurations in Steiner triple systems
- Bussey systems and Steiner's tactical problem
- Counting Star-Battle configurations
- Generalized configurations
- Configurations and \((r,1)\)-designs
- The \(L\)-functions and Modular Forms Database project
- Counting Blanks in Polygonal Arrangements
Uses Software
This page was built for publication: Counting configurations in designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953380)