On the number of partial Steiner systems

DOI<347::AID-JCD4>3.0.CO;2-8 10.1002/1520-6610(2000)8:5<347::AID-JCD4>3.0.CO;2-8zbMath0964.05012OpenAlexW2090984774MaRDI QIDQ4508624

Armen S. Asratian, Nikolaj Nikolaevich Kuzyurin

Publication date: 6 December 2000

Full work available at URL: https://doi.org/10.1002/1520-6610(2000)8:5<347::aid-jcd4>3.0.co;2-8

zbMATH Keywords

hypergraphmatchingpartial Steiner system

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

Asymptotic enumeration of linear hypergraphs with given number of vertices and edges, On the number of linear multipartite hypergraphs with given size, Counting Independent Sets in Hypergraphs

Cites Work

• On a packing and covering problem
• Near perfect coverings in graphs and hypergraphs
• The number of \(t\)-wise balanced designs
• On the number o f Steiner triple systems
• Nonisomorphic Steiner triple systems
• Random methods in design theory: A survey