Journal of Combinatorial Theory, Series A, Volume 89

Volume 89, Number 1, January 2000

• György Elekes, Lajos Rónyai:
  A Combinatorial Problem on Polynomials and Rational Functions. 1-20
  
• Hao Shen, Yizhu Wang:
  Embeddings of Resolvable Triple Systems. 21-42
  
• András Gács:
  On the Size of the Smallest Non-Classical Blocking Set of Rédei Type in PG(2, p). 43-54
  
• Soma Gupta:
  Sets of Integers with Missing Differences. 55-69
  
• Athula Gunawardena:
  Primitive Ovoids in O⁺₈(q). 70-76
  
• Louis J. Billera, Gábor Hetyei:
  Linear Inequalities for Flags in Graded Partially Ordered Sets. 77-104
  
• Konrad J. Swanepoel:
  Balancing Unit Vectors. 105-112
  
• Yair Caro, Raphael Yuster:
  Intersecting Designs. 113-125
  
• Géza Tóth:
  Note on Geometric Graphs. 126-132
  
• Noga Alon, Ehud Friedgut:
  On the Number of Permutations Avoiding a Given Pattern. 133-140
  
• Javier Cilleruelo:
  An Upper Bound for B₂[2] Sequences. 141-144
  
• Andreas Winter:
  Another Algebraic Proof of Bondy's Theorem on Induced Subsets. 145-147
  

Volume 89, Number 2, February 2000

• Esther R. Lamken, Richard M. Wilson:
  Decompositions of Edge-Colored Complete Graphs. 149-200
  
• Zhicheng Gao, Nicholas C. Wormald:
  The Distribution of the Maximum Vertex Degree in Random Planar Maps. 201-230
  
• Dan Saracino:
  On a Combinatorial Problem from the Model Theory of Wreath Products, III. 231-269
  
• Michel Lassalle:
  Une identité en théorie des partitions. 270-288
  
• Jiang Zeng:
  A Bijective Proof of Lassalle's Partition Identity. 289-290
  
• Kevin W. J. Kadell:
  A Dyson Constant Term Orthogonality Relation. 291-297
  
• Vesa Halava, Tero Harju, Lucian Ilie:
  Periods and Binary Words. 298-303