Journal of Combinatorial Theory, Series A, Volume 18

Volume 18, Number 1, January 1975

J. C. Fisher: Five-Valent Convex Polyhedra with Prescribed Faces. 1-11
William M. Kantor: Envelopes of Geometric Lattices. 12-26
Jean Françon: Acyclic and Parking Functions. 27-35
J. Randolph Stonesifer: Logarithmic Concavity for Edge Lattices of Graphs. 36-46
D. J. Crampin, Anthony J. W. Hilton: Remarks on Sade's Disproof of the Euler Conjecture with an Application to Latin Squares Orthogonal to Their Transpose. 47-59
Stephen W. Smoliar: On the Free Matrix Representation of Transversal Geometries. 60-70
Richard M. Wilson: An Existence Theory for Pairwise Balanced Designs, III: Proof of the Existence Conjectures. 71-79
Joan P. Hutchinson, Herbert S. Wilf: On Eulerian Circuits and Words with Prescribed Adjacency Patterns. 80-87
Leonard E. Baum, Lee P. Neuwirth: Decompositions of Vector Spaces over GF(2) into Disjoint Equidimensional Affine Spaces. 88-100
Seth R. Alpert: Twofold Triple Systems and Graph Imbeddings. 101-107
Joel Spencer: Ramsey's Theorem - A New Lower Bound. 108-115
Vera Pless: Symmetry Codes and Their Invariant Subcodes. 116-125
Charles C. Lindner: Disjoint Finite Partial Steiner Triple Systems Can Be Embedded in Disjoint Finite Steiner Triple Systems. 126-129

N. Hamada, H. Ohmori: On the BIB Design Having the Minimum p-Rank. 131-140
Robert Donaghey: Alternating Permutations and Binary Increasing Trees. 141-148
Jennifer Seberry Wallis: On Hadamard Matrices. 149-164
Ronald L. Graham: The Largest Small Hexagon. 165-170
George Converse: Symmetric Matrices with Given Row Sums. 171-176
W. O. Alltop: Extending t-Designs. 177-186
Steven Roman: A Problem of Zarankiewicz. 187-198
Michael L. Fredman: A Symmetry Relationship for a Class of Partitions. 199-202
Stanley E. Payne: All Generalized Quadrangles of Order 3 Are Known. 203-206
A. Hedayat: 3-Way BIB Designs. 207-209
David W. Boyd: The Asymptotic Number of Solutions of a Diophantine Equation from Coding Theory. 210-215
J. Randolph Stonesifer: Logarithmic Concavity for a Class of Geometric Lattices. 216-218
Albert Nijenhuis, Herbert S. Wilf: A Method and Two Algorithms on the Theory of Partitions. 219-222
Morton Abramson: A Simple Solution of Simon Newcomb's Problem. 223-225
Joachim Röhmel: On Smooth Incidence Structures with Constant Block Size and a Characterization of Finite Projective Spaces. 226-230
James E. Baumgartner: Partitioning Vector Spaces. 231-233
Walter Feit, Roger Lyndon, Leonard L. Scott: A Remark about Permutations. 234-235
J. R. Henderson, R. A. Dean: A General Upper Bound for 1-Widths. 236-238
David Kelly, Ivan Rival: Certain Partially Ordered Sets of Dimension Three. 239-242

Don Coppersmith: The Complement of Certain Recursively Defined Sets. 243-251
W. N. Hsieh: Families of Intersecting Finite Vector Spaces. 252-261
L. Carlitz, Richard Scoville: Generating Functions for Certain Types of Permutations. 262-275
Keith R. Milliken: Ramsey's Theorem with Sums or Unions. 276-290
A. Donald Keedwell: Row Complete Squares and a Problem of A. Kotzig Concerning P-Quasigroups and Eulerian Circuits. 291-304
Alexander Rosa: A Theorem on the Maximum Number of Disjoint Steiner Triple Systems. 305-312
Vera Pless: On the Classification and Enumeration of Self-Dual Codes. 313-335
R. R. Hall, T. H. Jackson, A. Sudbery, K. Wild: Some Advances in the No-Three-in-Line Problem. 336-341
G. I. Lehrer: On Incidence Matrices, Double Transitivity and Finite Groups. 342-344
Theodore S. Motzkin: Sets for Which No Point Lies on Many Connecting Lines. 345-348
Charles C. Lindner: A Partial Steiner Triple System of Order n Can Be Embedded in a Steiner Triple System of Order 6n + 3. 349-351
Tom C. Brown: Behrend's Theorem for Sequences Containing No k-Element Arithmetic Progression of a Certain Type. 352-356
P. F. Duvall Jr., R. E. Kibler: On the Parity of the Frequency of Cycle Lengths of Shift Register Sequences. 357-361