An extension of a theorem of the Bruijn and Erdős on combinatorial designs

DOI10.1016/0021-8693(68)90099-9zbMath0167.28001OpenAlexW1983234208MaRDI QIDQ2530736

Publication date: 1968

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-8693(68)90099-9

zbMATH Keywords

combinatorics

Related Items (66)

On generalizations of the deBruijn-Erdős theorem ⋮ All λ-Designs with Small λ are Type-1 ⋮ Rational congruence for uniform multiplicative designs ⋮ An infinite version of Ryser's inequality ⋮ Subsets of a finite set that almost always intersect each other in $\lambda$ elements ⋮ On the nonuniform Fisher inequality ⋮ An application of Ryser's (x,y)-theorem to a problem in statistics ⋮ Proof of a conjecture of Frankl and Füredi ⋮ Geometria combinatoria e geometrie finite ⋮ Multiplicative designs I: The normal and reducible cases ⋮ A theorem in combinatorial matrix theory ⋮ On set intersections ⋮ Towards the Ryser–Woodall λ $\lambda $‐design conjecture ⋮ Multiplicative designs II. Uniform normal and related structures ⋮ The work of June Huh ⋮ Exceptions and characterization results for type‐1 λ‐designs ⋮ Matrices and set intersections ⋮ Some results on the Ryser design conjecture ⋮ A finite set intersection theorem ⋮ Embeddings of Ultrametric Spaces in Finite Dimensional Structures ⋮ Some characterizations of type-1 $\lambda$-designs ⋮ An intersection problem whose extremum is the finite projective space ⋮ Lines in hypergraphs ⋮ Linear spaces on v points with v-2 mutually intersecting long lines ⋮ Intersection theorems with geometric consequences ⋮ A sharpening of Fisher's inequality ⋮ The symbiotic relationship of combinatorics and matrix theory ⋮ Lehman's forbidden minor characterization of ideal 0-1 matrices ⋮ A short proof of Fisher's inequality ⋮ Extension operations for cuts ⋮ Bipartite graphs with five eigenvalues and pseudo designs ⋮ The $\lambda$-designs with multiplicative duals ⋮ On smooth incidence structures with constant block size and a characterization of finite projective spaces ⋮ Unnamed Item ⋮ Forbidden Intersections ⋮ Geometric matrices and an inequality for (0,1)-matrices ⋮ A characterization of type-1 lambda-designs ⋮ A survey of pseudo $(v,k,\lambda)$-designs ⋮ Algebraic duality theorems with combinatorial applications ⋮ The combinatorics of N. G. de Bruijn ⋮ Some results on λ-designs with two block sizes ⋮ Matchings and covers in hypergraphs ⋮ On integer matrices obeying certain matrix equations ⋮ Linear CNF formulas and satisfiability ⋮ Modular Hadamard matrices and related designs. I ⋮ Incidence Bounds for Block Designs ⋮ Clique covers and coloring problems of graphs ⋮ A generalization of Fisher's inequality ⋮ Symmetric designs and related configurations ⋮ A characterization of symmetric block designs ⋮ Intersection properties of finite sets ⋮ A property of ($v$,$k$,$\lambda$)-designs ⋮ Near 1-designs ⋮ On Baer subspaces of finite projective spaces ⋮ The family of t-designs. II ⋮ On $\lambda$-designs ⋮ Resolvable pairwise balanced designs. ⋮ Replication results for certain combinatorial configurations ⋮ Subsets of a finite set that intersect each other in at most one element ⋮ A theorem on block designs ⋮ Strongly resolvable (r,lambda)-designs ⋮ A note on the structure of pairwise balanced designs ⋮ Non-regular square bipartite designs ⋮ Some results on the Ryser design conjecture-II ⋮ Maximal arcs in designs ⋮ Some results on the Ryser design conjecture. III

Cites Work

This page was built for publication: An extension of a theorem of the Bruijn and Erdős on combinatorial designs