Combinatorial designs and related systems
From MaRDI portal
Publication:2536059
DOI10.1016/0021-8693(69)90085-4zbMath0185.03206OpenAlexW2052136017MaRDI QIDQ2536059
Publication date: 1969
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-8693(69)90085-4
Related Items
A note on clutter partitions, Combinatorics of Cremona monomial maps, Subsets of a finite set that almost always intersect each other in \(\lambda\) elements, Lehman's Theorem and the Directed Steiner Tree Problem, Directed Moore hypergraphs, Integer matrices obeying generalized incidence equations, Factorizations of symmetric designs, A new infinite family of minimally nonideal matrices, Primes in the semigroup of Boolean matrices, An approach to solving \(A^{k}=J-I\), A classification of certain graphs with minimal imperfection properties, On circulant thin Lehman matrices, On ideal clutters, metrics and multiflows, One-overlapped factorizations of non-abelian groups, Some insight into characterizations of minimally nonideal matrices, Ideal clutters, Unnamed Item, The factors of a design matrix, Combinatorial designs related to the strong perfect graph conjecture, Opposite Elements in Clutters, On integer matrices obeying certain matrix equations, Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids, A generalization of the matrix equation \(A^ 2=J\), Lehman matrices, Thin Lehman matrices arising from finite groups, Symmetric designs and related configurations, Intersection properties of finite sets, Block designs with repeated blocks, A note on generalized (\(n,K,\lambda\))-systems, Near 1-designs, Structure of cubic Lehman matrices, Replication results for certain combinatorial configurations, A characterization of weakly bipartite graphs, Non-regular square bipartite designs
Cites Work
