An extremal problem for Graham-Rothschild parameter words
From MaRDI portal
Publication:803178
DOI10.1007/BF02124677zbMath0727.05060OpenAlexW2001010401MaRDI QIDQ803178
Publication date: 1989
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02124677
Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Ramsey theory (05D10)
Related Items
Combinatorial reconstruction problems, Kernels of modular inclusion maps, PAC-learning from general examples, Inclusion matrices for rainbow subsets, The \(k\)-orbit reconstruction and the orbit algebra, On families in finite lattices
Cites Work
- On functions of strength t
- Linear dependencies among subsets of a finite set
- Embedding of \(\ell^ k_{\infty}\) in finite dimensional Banach spaces
- On the density of sets of vectors
- A combinatorial interpretation of \((1/k!)\Delta ^ kt^ n\)
- Coordinate density of sets of vectors
- On the trace of finite sets
- On the number of sets in a null t-design
- On the vector space of 0-configurations
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- The module structure of integral designs
- On the Structure oft-Designs
- Ramsey's Theorem for n-Parameter Sets
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- Abstract Theory of Inversion of Finite Series
