default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series A, Volume 22
Volume 22, Number 1, January 1977
- David C. Rine:
Optimizing Two Types of Discrete Functions, Subject to Linear Restrictions. 1-16 - Harold Fredricksen, Irving J. Kessler:
Lexicographic Compositions and deBruijn Sequences. 17-30 - D. M. Silberger:
Uniformly Deep Families of k-Membered Subsets of n. 31-37 - Henry Beker, Fred Piper:
Some Designs Which Admit Strong Tactical Decompositions. 38-42 - Clement W. H. Lam:
Cyclotomy and Addition Sets. 43-60 - Melvyn B. Nathanson:
Permutations, Periodicity, and Chaos. 61-68 - Michael Aissen:
Varieties of Binary Systems. 69-82 - Mark P. Hale Jr.:
Finite Geometries which Contain Dual Affine Planes. 83-91 - David M. Jackson:
The Unification of Certain Enumeration Problems. 92-96 - Charles C. Lindner, Alexander Rosa:
A Partial Room Square Can be Embedded in a Room Square. 97-102 - Edward Spence:
A Family of Difference Sets. 103-106 - Eugenio Calabi, Herbert S. Wilf:
On the Sequential and Random Selection of Subspaces over a Finite Field. 107-109 - F. Jessie MacWilliams, Andrew M. Odlyzko:
Pelikán's Conjecture Cyclotomic Cosets. 110-114 - V. J. Baston, F. A. Bostock:
Copying Configurations in Algebraic Extensions of Prime Fields. 115-117 - Peter Yff:
On Subplane Partitions of a Finite Projective Plane. 118-122
Volume 22, Number 2, March 1977
- Jim Totten:
Embeddability of Restricted Linear Spaces. 123-128 - L. Carlitz, Richard Scoville:
Some Permutation Problems. 129-145 - Oliver Pretzel:
On the Dimension of Partially Ordered Sets. 146-152 - J. I. Hall:
On Two Conjectures of Stanton and Mullin. 153-162 - Sanpei Kageyama:
Classifications of Certain t-Designs. 163-168 - Leonard E. Baum, Norman P. Herzberg, S. J. Lomonaco Jr., Melvin M. Sweet:
Fields of Almost Periodic Sequences. 169-180 - H. J. Ryser:
The Factors of a Design Matrix. 181-193 - Richard A. Brualdi, Peter M. Gibson:
Convex Polyhedra of Doubly Stochastic Matrices. I. Applications of the Permanent Function. 194-230 - J. S. Huang, B. L. Raktoe:
A Note on the Proportion of Singular (0, 1)-Matrices in a Class Associated with Fractional 2n Factorial Designs. 231-234 - L. Carlitz:
Some Combinatorial Identities of Sarmanov, Sevast'yanov, and Tarakanov. 235-240 - V. J. Baston, F. A. Bostock:
Generalizations of a Combinatorial Lemma of Kelly. 241-245 - H. O. Foulkes:
A Nonrecursive Combinatorial Rule for Eulerian Numbers. 246-248 - Peter Frankl:
On the Minimum Number of Disjoint Pairs in a Family of Finite Sets. 249-251
Volume 22, Number 3, May 1977
- Robert E. Jamison:
Covering Finite Fields with Cosets of Subspaces. 253-266 - Stanley E. Payne:
Generalized Quadrangles of Order 4. I. 267-279 - Stanley E. Payne:
Generalized Quadrangles of Order 4. II. 280-288 - Jaroslav Nesetril
, Vojtech Rödl:
Partitions of Finite Relational and Set Systems. 289-312 - Albert L. Wells Jr.:
On the Completion of Partial Latin Squares. 313-321 - Vassili C. Mavron:
Translations and Parallel Classes of Lines in Affine Designs. 322-330 - A. Hedayat:
A Complete Solution to the Existence and Nonexistence of Knut Vik Designs and Orthogonal Knut Vik Designs. 331-337 - Richard A. Brualdi, Peter M. Gibson:
Convex Polyhedra of Doubly Stochastic Matrices III. Affine and Combinatorial Properties of Omegan. 338-351 - Peter Frankl, Mikhail Deza:
On the Maximum Number of Permutations with Given Maximal or Minimal Distance. 352-360 - William G. Bridges:
A Characterization of Type-1 lambdy-Designs. 361-367 - G. F. Clements:
An Existence Theorem for Antichains. 368-371 - Daniel E. Novoseller, M. L. Glasser:
A Combinatorial Identity. 372-377 - Gary S. Bloom:
A Counterexample to a Theorem of S. Piccard. 378-379 - Richard N. Ball:
Decomposition of Nonnegative Integral Matrices. 380-383
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
