The fine triangle intersections for maximum kite packings
From MaRDI portal
Publication:1949655
Abstract: In this paper the fine triangle intersection problem for a pair of maximum kite packings is investigated. Let a pair of maximum kite packings of order intersecting in blocks and triangles. Let are non-negative integers, where . It is established that for any integer and ; for any integer and .
Recommendations
Cites work
- A new class of group divisible designs with block size three
- Construction of Steiner quadruple systems having a prescribed number of blocks in common
- scientific article; zbMATH DE number 4104964 (Why is no real title available?)
- scientific article; zbMATH DE number 68342 (Why is no real title available?)
- scientific article; zbMATH DE number 165087 (Why is no real title available?)
- scientific article; zbMATH DE number 3487460 (Why is no real title available?)
- scientific article; zbMATH DE number 1833097 (Why is no real title available?)
- scientific article; zbMATH DE number 825145 (Why is no real title available?)
- scientific article; zbMATH DE number 2192200 (Why is no real title available?)
- Intersection numbers of Kirkman triple systems
- Intersections among Steiner systems
- Steiner Triple Systems Having a Prescribed Number of Triples in Common
- The fine triangle intersection problem for \((K_4 - e)\)-designs
- The fine triangle intersection problem for kite systems
- The intersection problem for \(K_4-e\) designs
- The triangle intersection problem for \(K_4-e\) designs
- The triangle intersection problem for S(2,4,v) designs
- Tight blocking sets in some maximum packings of K_n
Cited in
(5)
This page was built for publication: The fine triangle intersections for maximum kite packings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949655)