Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series A, Volume 16
Volume 16, Number 1, January 1974
- Thomas W. Cusick:
View-Obstruction Problems in n-Dimensional Geometry. 1-11 - H. L. Abbott, E. R. Williams:
Lower Bounds for Some Ramsey Numbers. 12-17 - Allan B. Cruse:
On Embedding Incomplete Symmetric Latin Squares. 18-22 - Joseph Douglas Horton:
Sub-Latin Squares and Incomplete Orthogonal Arrays. 23-33 - David A. Drake:
Near Affine Hjelmslev Planes. 34-50 - Donald E. Taylor
:
Unitary Block Designs. 51-56 - Earl S. Kramer:
On lambda-Designs. 57-75 - J. F. Lawless:
On the Construction of Handcuffed Designs. 76-86 - Robert Piziak:
Symplectic Orthogonality Spaces. 87-96 - B. L. Rothschild, Jack H. van Lint:
Characterizing Finite Subspaces. 97-110 - Ashok K. Chandra:
Independent Permutations, as Related to a Problem of Moser and a Theorem of Pólya. 111-120 - Robert Patenaude:
The lambda-Designs with Multiplicative Duals. 121-125 - Alexander Rosa:
On the Falsity of a Conjecture on Orthogonal Steiner Triple Systems. 126-128 - William Watkins, Russell Merris:
Convex Sets of Doubly Stochastic Matrices. 129-130
Volume 16, Number 2, March 1974
- Mordechai Lewin:
Coverings of Transfinite Matrices. 131-146 - Nagayoshi Iwahori:
On a Set of Generating Relations of the Full Transformation Semigroups. 147-158 - Roger C. Entringer, Douglas E. Jackson, J. A. Schatz:
On Nonrepetitive Sequences. 159-164 - Amos Altshuler:
Combinatorial 3-Manifolds with Few Vertices. 165-173 - Stephen H. Y. Hung, N. S. Mendelsohn:
On Howell Designs. 174-198 - Saharon Shelah:
A Substitute for Hall's Theorem for Families with Infinite Sets. 199-208 - John Rhodes:
Proof of the Fundamental Lemma of Complexity (Strong Version) for Arbitrary Finite Semigroups. 209-214 - Daniel J. Kleitman, Thomas L. Magnanti:
On the Number of Latent Subsets of Intersecting Collections. 215-220 - Leslie E. Shader:
On the Existence of Finite Central Groupoids of All Possible Ranks I. 221-229 - Felipe Ruiz:
Some Results on Construction of Orthogonal Latin Squares by the Method of Sum Composition. 230-240 - N. M. Singhi:
(19, 9, 4) Hadamard Designs and Their Residual Designs. 241-252 - Peter H. Sellers:
An Algorithm for the Distance Between Two Finite Sequences. 253-258 - Alan C. Tucker:
The Cost of a Class of Optimal Binary Trees. 259-263 - Kenneth B. Gross:
Equivalence of Room Designs I. 264-265 - Ervin Gergely:
A Simple Method for Constructing Doubly Diagonalized Latin Squares. 266-272
Volume 16, Number 3, May 1974
- Earl S. Kramer, Dale M. Mesner:
Intersections Among Steiner Systems. 273-285 - Daniel A. Marcus:
Direct Decompositions in Free Commutative Monoids. 286-312 - Richard J. Turyn:
Hadamard Matrices, Baumert-Hall Units, Four-Symbol Sequences, Pulse Compression, and Surface Wave Encodings. 313-333 - Peter J. Lorimer:
A Projective Plane of Order 16. 334-347 - Michael Goldberg:
Three Infinite Families of Tetrahedral Space-Fillers. 348-354 - J. R. Henderson, R. A. Dean:
The 1-Width of (0, 1)-Matrices Having Constant Row Sum 3. 355-370 - Jon Folkman:
Notes on the Ramsey Number N(3, 3, 3, 3). 371-379 - David B. Weinberger:
Sufficient Regularity Conditions for Common Transversals. 380-390 - Sherman K. Stein:
Two Combinatorial Covering Theorems. 391-397 - Donald E. Knuth:
The Asymptotic Number of Geometries. 398-400
a service of 
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-04-19 19:19 CEST 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:
