Intersection properties of finite sets

DOI10.1016/0097-3165(73)90065-4zbMath0248.05006OpenAlexW1981394831MaRDI QIDQ2556407

H. J. Ryser

Publication date: 1973

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(73)90065-4

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other combinatorial set theory (03E05) Designs and configurations (05Bxx)

Related Items (8)

Clique coverings of graphs V: maximal-clique partitions ⋮ General forbidden configuration theorems ⋮ A forbidden configuration theorem of Alon ⋮ Uniform hypergraphs under certain intersection constraints between hyperedges ⋮ Indeterminates and incidence matrices^† ⋮ Information storage and retrieval - mathematical foundations. II: Combinatorial problems ⋮ Properties of (0,1)-matrices with no triangles ⋮ Properties of (0,1)-matrices without certain configurations

Cites Work

• Unnamed Item
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• An extension of a theorem of the Bruijn and Erdős on combinatorial designs
• Combinatorial designs and related systems
• A generalization of the matrix equation \(A^ 2=J\)
• Symmetric designs and related configurations
• On Moore Graphs with Diameters 2 and 3
• Products of Zero-One Matrices
• On a combinatorial generalization of 27 lines associated with a cubic surface
• Combinatorial Configurations
• Square λ-Linked Designs
• Strongly Regular Graphs Derived from Combinatorial Designs
• Designs derived from permutation groups
• On some Theorems in Combinatorics Relating to Incomplete Block Designs
• A problem in partitions

This page was built for publication: Intersection properties of finite sets