Journal of Combinatorial Theory, Series A, Volume 31
Volume 31, Number 1, July 1981
Xavier Gérard Viennot:
Équidistribution des permutations ayant une forme donnée selon les avances et coavances. 43-55 Richard P. Stanley:
Two Combinatorial Applications of the Aleksandrov-Fenchel Inequalities. 56-65 Gábor Korchmáros:
Example of a Chain of Circles on an Elliptic Quadric of PG(3, q), q=7, 11. 98-100
Volume 31, Number 2, September 1981
John Konvalina:
On the Number of Combinations without Unit Separation. 101-107 Yoshimi Egawa:
Characterization of H(n, q) by the Parameters. 108-125 Michael Mörs:
A New Result on the Problem of Zarankiewicz. 126-130 Keisuke Uchimura:
An Identity for the Divisor Generating Function Arising from Sorting Theory. 131-135 Tony T. Lee:
Order-Preserving Representations of the Partitions on the Finite Set. 136-145 K. J. Falconer:
The Realization of Distances in Measurable Subsets Covering Rn. 184-189 Ching-Shui Cheng:
A Family of Pseudo Youden Designs with Row Size Less than the Number of Symbols. 219-221
Volume 31, Number 3, November 1981
Louis J. Billera,
Carl W. Lee:
A Proof of the Sufficiency of McMullen's Conditions for f-Vectors of Simplicial Convex Polytopes. 237-255 Richard P. Anstee:
Properties of (0, 1)-Matrices without Certain Configurations. 256-269
maintained by
at
Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar
Vladimir Lifschitz, Boris Pittel:
last updated on 2018-07-12 22:05 CEST by the dblp team
data released under the ODC-BY 1.0 license