An extension of a theorem of the Bruijn and Erdős on combinatorial designs
From MaRDI portal
Publication:2530736
DOI10.1016/0021-8693(68)90099-9zbMATH Open0167.28001OpenAlexW1983234208MaRDI QIDQ2530736FDOQ2530736
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Note on Fisher's Inequality for Balanced Incomplete Block Designs
- The Lines and Planes Connecting the Points of a Finite Set
- A Note on a Combinatorial Problem
- On some Theorems in Combinatorics Relating to Incomplete Block Designs
- Matrices with Integer Elements in Combinatorial Investigations
- An Inequality for Incidence Matrices
- Title not available (Why is that?)
- On Integer Matrices and Incidence Matrices of Certain Combinatorial Configurations, I: Square Matrices
Cited In (69)
- An infinite version of Ryser's inequality
- A short proof of Fisher's inequality
- A survey of pseudo \((v,k,\lambda)\)-designs
- Non-regular square bipartite designs
- Intersection properties of finite sets
- Resolvable pairwise balanced designs.
- Subsets of a finite set that intersect each other in at most one element
- Geometric matrices and an inequality for (0,1)-matrices
- A sharpening of Fisher's inequality
- Lehman's forbidden minor characterization of ideal 0-1 matrices
- A generalization of Fisher's inequality
- All λ-Designs with Small λ are Type-1
- Modular Hadamard matrices and related designs. I
- An application of Ryser's (x,y)-theorem to a problem in statistics
- Clique covers and coloring problems of graphs
- On generalizations of the deBruijn-Erdős theorem
- Intersection theorems with geometric consequences
- Extension operations for cuts
- Multiplicative designs I: The normal and reducible cases
- On a conjecture of Frankl and Füredi
- Maximal arcs in designs
- Bipartite graphs with five eigenvalues and pseudo designs
- Replication results for certain combinatorial configurations
- Some results on λ-designs with two block sizes
- Incidence bounds for block designs
- Near 1-designs
- The symbiotic relationship of combinatorics and matrix theory
- The combinatorics of N. G. de Bruijn
- Linear CNF formulas and satisfiability
- Rational congruence for uniform multiplicative designs
- An intersection problem whose extremum is the finite projective space
- Multiplicative designs II. Uniform normal and related structures
- A finite set intersection theorem
- On the nonuniform Fisher inequality
- A theorem on block designs
- A characterization of symmetric block designs
- Matchings and covers in hypergraphs
- The family of t-designs. II
- Geometria combinatoria e geometrie finite
- Some characterizations of type-1 \(\lambda\)-designs
- On set intersections
- A property of (\(v\),\(k\),\(\lambda\))-designs
- A note on the structure of pairwise balanced designs
- On Baer subspaces of finite projective spaces
- Linear spaces on v points with v-2 mutually intersecting long lines
- A characterization of type-1 lambda-designs
- Forbidden Intersections
- Strongly resolvable (r,lambda)-designs
- Embeddings of Ultrametric Spaces in Finite Dimensional Structures
- Proof of a conjecture of Frankl and Füredi
- A theorem in combinatorial matrix theory
- Matrices and set intersections
- Algebraic duality theorems with combinatorial applications
- Symmetric designs and related configurations
- On \(\lambda\)-designs
- On smooth incidence structures with constant block size and a characterization of finite projective spaces
- Lines in hypergraphs
- The \(\lambda\)-designs with multiplicative duals
- Subsets of a finite set that almost always intersect each other in \(\lambda\) elements
- Exceptions and characterization results for type‐1 λ‐designs
- Some results on the Ryser design conjecture. III
- Some results on the Ryser design conjecture
- Some results on the Ryser design conjecture-II
- Point-line geometries related to binary equidistant codes
- A note on \(\lambda\)-designs
- On integer matrices obeying certain matrix equations
- Some results on \(\lambda\)-design conjecture
- The work of June Huh
- Towards the Ryser–Woodall λ $\lambda $‐design conjecture
This page was built for publication: An extension of a theorem of the Bruijn and Erdős on combinatorial designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2530736)
