Journal of Combinatorial Theory, Series A, Volume 31

Volume 31, Number 1, July 1981

• Vladimir Lifschitz, Boris Pittel: The Number of Increasing Subsequences of the Random Permutation. 1-20 BibTeX
• Ronald L. Graham, Wen-Ching Winnie Li, J. L. Paul: Homogeneous Collinear Sets in Partitions of Zⁿ. 21-32 BibTeX
• Robert A. Sulanke: A Generalized q-Multinomial Vandermonde Convolution. 33-42 BibTeX
• Xavier Gérard Viennot: Équidistribution des permutations ayant une forme donnée selon les avances et coavances. 43-55 BibTeX
• Richard P. Stanley: Two Combinatorial Applications of the Aleksandrov-Fenchel Inequalities. 56-65 BibTeX
• Noboru Ito, Jeffrey S. Leon: Classification of 3-(24, 12, 5) Designs and 24-Dimensional Hadamard Matrices. 66-93 BibTeX
• K. J. Harrison, W. E. Longstaff: Subalgebras of Incidence Algebras Determined by Equivalence Relations. 94-97 BibTeX
• Gábor Korchmáros: Example of a Chain of Circles on an Elliptic Quadric of PG(3, q), q=7, 11. 98-100 BibTeX

Volume 31, Number 2, September 1981

• John Konvalina: On the Number of Combinations without Unit Separation. 101-107 BibTeX
• Yoshimi Egawa: Characterization of H(n, q) by the Parameters. 108-125 BibTeX
• Michael Mörs: A New Result on the Problem of Zarankiewicz. 126-130 BibTeX
• Keisuke Uchimura: An Identity for the Divisor Generating Function Arising from Sorting Theory. 131-135 BibTeX
• Tony T. Lee: Order-Preserving Representations of the Partitions on the Finite Set. 136-145 BibTeX
• D. C. Van Leijenhorst: Orbits on the Projective Line. 146-154 BibTeX
• William G. Bridges, Marshall Hall Jr., John L. Hayden: Codes and Designs. 155-174 BibTeX
• Don Rawlings: The r-Major Index. 175-183 BibTeX
• K. J. Falconer: The Realization of Distances in Measurable Subsets Covering Rⁿ. 184-189 BibTeX
• Norman Lindquist, Gerard Sierksma: Extensions of Set Partitions. 190-198 BibTeX
• Aviezri S. Fraenkel, David Lichtenstein: Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n. 199-214 BibTeX
• Jacob E. Goodman, Richard Pollack: Three Points Do Not Determine a (Pseudo-) Plane. 215-218 BibTeX
• Ching-Shui Cheng: A Family of Pseudo Youden Designs with Row Size Less than the Number of Symbols. 219-221 BibTeX

Volume 31, Number 3, November 1981

• Daniel I. A. Cohen: PIE-Sums: A Combinatorial Tool for Partition Theory. 223-236 BibTeX
• Louis J. Billera, Carl W. Lee: A Proof of the Sufficiency of McMullen's Conditions for f-Vectors of Simplicial Convex Polytopes. 237-255 BibTeX
• Richard P. Anstee: Properties of (0, 1)-Matrices without Certain Configurations. 256-269 BibTeX
• Christiane Lefevre-Percsy: Classification d'une famille d'ensembles de classe (0, 1, n, q+1) de PG(d, q). 270-276 BibTeX
• J. H. Ahrens: Paving the Chessboard. 277-288 BibTeX
• Adriano M. Garsia, Stephen C. Milne: A Rogers-Ramanujan Bijection. 289-339 BibTeX