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