Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Comb.~Theory Series A AND Volume=28
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
über Partitionen endlicher Teilmengen
Kurt Wolfsdorf
Journal of Combinatorial Theory Series A
28
, 1980, pp. 1-6
Polyominoes on the infinite checkerboard
M.S. Klamkin
,
A. Liu
Journal of Combinatorial Theory Series A
28
, 1980, pp. 7-16
Application of the Berry-Esséen inequality to combinatorial estimates
E. Rodney Canfield
Journal of Combinatorial Theory Series A
28
, 1980, pp. 17-25
On the enumeration of self-dual codes
J.H. Conway
,
Vera Pless
Journal of Combinatorial Theory Series A
28
, 1980, pp. 26-53
On Sperner families in which no
K
sets have an empty intersection
Hans-Dietrich O.F. Gronau
Journal of Combinatorial Theory Series A
28
, 1980, pp. 54-63
2-designs having an intersection number
k-n
Henry Beker
,
Willem Haemers
Journal of Combinatorial Theory Series A
28
, 1980, pp. 64-81
A Sperner theroem for the interval order of a projective geometry
L.H. Harper
Journal of Combinatorial Theory Series A
28
, 1980, pp. 82-88
On partitions of
E^n
R.L. Graham
Journal of Combinatorial Theory Series A
28
, 1980, pp. 89-97
Lattice paths in regions with the Catalan property
J.W. Moon
Journal of Combinatorial Theory Series A
28
, 1980, pp. 98-102
On set intersections
László Babai
,
Péter Frankl
Journal of Combinatorial Theory Series A
28
, 1980, pp. 103-105
A note on the intersection properties of subsets of integers
R.L. Graham
,
M. Simonovits
,
V.T. Sós
Journal of Combinatorial Theory Series A
28
, 1980, pp. 106-110
A combinatorial interpretation for two transformations of series that commute with compositional inversion
Robert Donaghey
Journal of Combinatorial Theory Series A
28
, 1980, pp. 111-114
A bijection of the set of 3-regular partitions
G. Mullineux
Journal of Combinatorial Theory Series A
28
, 1980, pp. 115-124
Completing partial Latin squares
Richard Crittenden
,
Charles Vanden Eynden
Journal of Combinatorial Theory Series A
28
, 1980, pp. 125-129
Cyclic designs and uniformly deep families
Wayne M. Dymacek
,
D.P. Roselle
Journal of Combinatorial Theory Series A
28
, 1980, pp. 130-139
Collinear subsets of lattice point sequences-An analog of Szemerédi's theorem
Carl Pomerance
Journal of Combinatorial Theory Series A
28
, 1980, pp. 140-149
Sumsets contained in infinite sets of integers
Melvyn B. Nathanson
Journal of Combinatorial Theory Series A
28
, 1980, pp. 150-155
On chains and Sperner
k
-families in ranked posets
Jerrold R. Griggs
Journal of Combinatorial Theory Series A
28
, 1980, pp. 156-168
Catégories de Möbius et fonctorialités: Un cadre général pour l'inversion de Möbius
Mireille Content
,
François Lemay
,
Pierre Leroux
Journal of Combinatorial Theory Series A
28
, 1980, pp. 169-190
An algebraic theory of sequence enumeration
William T. Spears
,
Barbara Jeffcott
,
D.M. Jackson
Journal of Combinatorial Theory Series A
28
, 1980, pp. 191-218
``Bicoverings of a finite set'' by generating function methods
James Reilly
Journal of Combinatorial Theory Series A
28
, 1980, pp. 219-225
t\frac{1}{2}
-designs
A. Neumaier
Journal of Combinatorial Theory Series A
28
, 1980, pp. 226-248
Matrices of 0's and 1's with total support
Richard A. Brualdi
Journal of Combinatorial Theory Series A
28
, 1980, pp. 249-256
The partition problem for finite Abelian groups
Bernd Voigt
Journal of Combinatorial Theory Series A
28
, 1980, pp. 257-271
A Pólya interpretation of the Schur function
Dennis E. White
Journal of Combinatorial Theory Series A
28
, 1980, pp. 272-281
Seiten 1
2
>