default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series A, Volume 28
Volume 28, Number 1, January 1980
- Kurt Wolfsdorf:
Über Partitionen Endlicher Teilmengen. 1-6 - Murray S. Klamkin, A. Liu:
Polyominoes on the Infinite Checkerboard. 7-16 - E. Rodney Canfield:
Application of the Berry-Esséen Inequality to Combinatorial Estimates. 17-25 - John H. Conway, Vera Pless:
On the Enumeration of Self-Dual Codes. 26-53 - Hans-Dietrich O. F. Gronau:
On Sperner Families in which No K Sets Have an Empty Intersection. 54-63 - Henry Beker:
2-Designs Having an Intersection Number k - n. 64-81 - Lawrence H. Harper:
A Sperner Theorem for the Interval Order of a Projective Geometry. 82-88 - Ronald L. Graham:
On Partitions of En. 89-97 - John W. Moon:
Lattice Paths in Regions with the Catalan Property. 98-102 - László Babai
, Peter Frankl:
On Set Intersections. 103-105 - Ronald L. Graham, Miklós Simonovits, Vera T. Sós:
A Note on the Intersection Properties of Subsets of Integers. 106-110 - Robert Donaghey:
A Combinatorial Interpretation for Two Transformations of Series that Commute with Compositional Inversion. 111-114
Volume 28, Number 2, March 1980
- Glen Mullineux:
A Bijection of the Set of 3-Regular Partitions. 115-124 - Richard Crittenden, Charles Vanden Eynden:
Completing Partial Latin Squares. 125-129 - Wayne M. Dymàcek, D. P. Roselle:
Cyclic Designs and Uniformly Deep Families. 130-139 - Carl Pomerance:
Collinear Subsets of Lattice Point Sequences - An Analog of Szemerédi's Theorem. 140-149 - Melvyn B. Nathanson:
Sumsets Contained in Infinite Sets of Integers. 150-155 - Jerrold R. Griggs:
On Chains and Sperner k-Families in Ranked Posets. 156-168 - Mireille Content, François Lemay, Pierre Leroux:
Catégories de Möbius et fonctorialités: un cadre général pour I'inversioin de Möbius. 169-190 - William T. Spears, Barbara Jeffcott, David M. Jackson:
An Algebraic Theory of Sequence Enumeration. 191-218
Volume 28, Number 3, May 1980
- James Reilly:
"Bicoverings of a Finite Set" by Generating Function Methods. 219-225 - Arnold Neumaier:
t1/2 - Designs. J. Comb. Theory A 28(3): 226-248 (1980) - Richard A. Brualdi:
Matrices of 0's and 1's with Total Support. 249-256 - Bernd Voigt:
The Partition Problem for Finite Abelian Groups. 257-271 - Dennis E. White:
A Pólya Interpretation of the Schur Function. 272-281 - Zoltán Füredi:
On Maximal Intersecting Families of Finite Sets. 282-289 - Luc Teirlinck:
On Projective and Affine Hyperplanes. 290-306 - Dominique Dumont:
Une généralisation trivariée symétrique des nombres eulériens. 307-320 - Ira M. Gessel:
A Factorization for Formal Laurent Series and Lattice Path Enumeration. 321-337 - Miroslav Benda:
On Harrington's Partition Relation. 338-350
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-22 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
