Combinatorial Configurations
From MaRDI portal
Publication:5579517
DOI10.1137/0117056zbMath0186.01901OpenAlexW4240882808MaRDI QIDQ5579517
Publication date: 1969
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0117056
Related Items
D-optimal statistical designs with restricted string property, General forbidden configuration theorems, Convexity in Graphs and Hypergraphs, Forbidden configurations: Induction and linear algebra, Testing for class membership in multi-parent hierarchies, On joint realization of (0,1) matrices, A forbidden configuration theorem of Alon, An approach to solving \(A^{k}=J-I\), Configuration space of geometric objects, A Fundamental Matrix Equation for Finite Sets, Totally positive matrices and totally positive hypergraphs, Recognizing Helly edge-path-tree graphs and their clique graphs, Information storage and retrieval - mathematical foundations. II: Combinatorial problems, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Exact bounds for (λ,n)–stable 0-1 matrices., A structure theorem for the consecutive 1's property, A characterization of \((\lambda,2)\)-stable (0,1) matrices, Intersection properties of finite sets, Optimal weighing designs with a string property, Properties of (0,1)-matrices with no triangles, Properties of (0,1)-matrices without certain configurations, Circular representation problem on hypergraphs, Asymptotically optimal weighing designs with string property, A characterization of totally balanced hypergraphs, Cyclic arrangements with minimum modulo \(m\) winding numbers
