On families in finite lattices
From MaRDI portal
Publication:810551
DOI10.1016/S0195-6698(13)80071-6zbMath0734.06007MaRDI QIDQ810551
Publication date: 1990
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Extremal set theory (05D05) Other designs, configurations (05B30) Other combinatorial set theory (03E05) Vector spaces, linear dependence, rank, lineability (15A03) Lattices (06B99)
Related Items
A common generalization to theorems on set systems with \(\mathcal L\)-intersections, Families of vector spaces with \(r\)-wise \(\mathcal{L}\)-intersections, \(r\)-cross \(t\)-intersecting families for vector spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A short proof of the nonuniform Ray-Chaudhuri-Wilson inequality
- On functions of strength t
- An extremal problem for Graham-Rothschild parameter words
- Intersection theorems for vector spaces
- A combinatorial interpretation of \((1/k!)\Delta ^ kt^ n\)
- Intersection theorems with geometric consequences
- On t-designs
- On the number of sets in a null t-design
- A combinatorial problem; stability and order for models and theories in infinitary languages
- A class of geometric lattices based on finite groups
- On the density of families of sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Baire Sets of k-Parameter Words are Ramsey
- A note on constructive methods for ramsey numbers
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- Some remarks on the theory of graphs
