Journal of Combinatorial Theory, Series A, Volume 34

Volume 34, Number 1, January 1983

• Gérard Viennot:
  Maximal Chains of Subwords and Up-Down Sequences of Permutations. 1-14
  
• Dennis Stanton:
  Generalized n-gons and Chebychev Polynomials. 15-27
  
• John S. Summer, Alton T. Butson:
  Relative Addition Sets and Partially Balanced Incomplete Block Designs. 28-40
  
• Peter Frankl:
  On the Trace of Finite Sets. 41-45
  
• James A. Flanigan:
  Slow Joins of Loopy Games. 46-59
  
• Michael Tarsi:
  Decomposition of a Complete Multigraph into Simple Paths: Nonbalanced Handcuffed Designs. 60-70
  
• H. Groemer:
  On Space Coverings by Unbounded Convex Sets. 71-79
  
• Herbert S. Wilf:
  Sieve Equivalence in Generalized Partition Theory. 80-89
  
• Basil Gordon:
  Sieve-Equivalence and Explicit Bijections. 90-93
  
• Bal Kishan Dass:
  Burst Distribution of a Linear Code. 94-97
  
• Peter C. Fishburn:
  Balanced Integer Arrays: A Matrix Packing Theorem. 98-101
  
• Alan J. Hoffman:
  Extending Greene's Theorem to Directed Graphs. 102-107
  
• Jaroslav Nesetril, Vojtech Rödl:
  Another Proof of the Folkman-Rado-Sanders Theorem. 108-109
  
• Frank K. Hwang, Ko-Wei Lih:
  Latin Squares and Superqueens. 110-114
  
• Anne Fontaine, George E. Martin:
  Tetramorphic and Pentamorphic Prototiles. 115-118
  
• Anne Fontaine, George E. Martin:
  Polymorphic Prototiles. 119-121
  

Volume 34, Number 2, March 1983

• J. C. Lagarias, Andrew M. Odlyzko, James B. Shearer:
  On the Density of Sequences of Integers the Sum of No Two of Which Is a Square II. General Sequences. 123-139
  
• Jia-Xi Lu:
  On Large Sets of Disjoint Steiner Triple Systems I. 140-146
  
• Jia-Xi Lu:
  On Large Sets of Disjoint Steiner Triple Systems II. 147-155
  
• Jia-Xi Lu:
  On Large Sets of Disjoint Steiner Triple Systems III. 156-182
  
• Jaroslav Nesetril, Vojtech Rödl:
  Ramsey Classes of Set Systems. 183-201
  
• Ron Aharoni:
  On the Equivalence of Two Conditions for the Existence of Transversals. 202-214
  
• David E. Daykin, Anthony J. W. Hilton, D. Miklós:
  Pairings from Down-Sets and Up-Sets in Distributive Lattices. 215-230
  
• Yehuda Roditty:
  Packing and Covering of the Complete Graph with a Graph G of Four Vertices or Less. 231-243
  
• Noboru Ito, Jeffrey S. Leon:
  An Hadamard Matrix of Order 36. 244-247
  
• Richard A. Games:
  There Are No De Bruijn Sequences of Span n with Complexity 2^n-1+n+1. 248-251
  
• J. P. Imhof:
  Stirling Numbers and Records. 252-254
  

Volume 34, Number 3, May 1983

• Edward A. Bender, L. Bruce Richmond:
  Central and Local Limit Theorems Applied to Asymptotic Enumeration II: Multivariate Generating Functions. 255-265
  
• David A. Drake, Jean A. Larson:
  Pairwise Balanced Designs Whose Line Sizes Do Not Divide Six. 266-300
  
• B. M. I. Rands:
  An Association Scheme for the 1-Factors of the Complete Graph. 301-312
  
• Richard M. Wilson:
  Inequalities for t Designs. 313-324
  
• Joel Spencer:
  Canonical Configurations. 325-330
  
• Walter A. Deuber, Ronald L. Graham, Hans Jürgen Prömel, Bernd Voigt:
  A Canonical Partition Theorem for Equivalence Relations on Z^t. 331-339
  
• W. H. Mills, David P. Robbins, Howard Rumsey Jr.:
  Alternating Sign Matrices and Descending Plane Partitions. 340-359
  
• John L. Hayden:
  Association Algebras for Finite Projective Planes. 360-374
  
• Charles J. Colbourn, Marlene J. Colbourn:
  Every Twofold Triple System Can Be Directed. 375-378
  
• John R. Isbell:
  N(5, 4;3) >= 24. 379-380
  
• Joseph A. Thas:
  Elementary Proofs of Two Fundamental Theorems of B. Segre without Using the Hasse-Weil Theorem. 381-384
  

Last update Fri May 25 09:30:42 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page