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=30
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Comma-free codes: An extension of certain enumerative techniques to recursively defined sequences
J.S. Devitt
,
D.M. Jackson
Journal of Combinatorial Theory Series A
30
, 1981, pp. 1-18
Periods in strings
Leo J. Guibas
,
Andrew M. Odlyzko
Journal of Combinatorial Theory Series A
30
, 1981, pp. 19-42
An algebraic study of BIB designs: A complete solution for
v = 6
and
k = 3
A. Hedayat
,
G.B. Khosrovshahi
Journal of Combinatorial Theory Series A
30
, 1981, pp. 43-52
Some bounds for the Ramsey-Paris-Harrington numbers
Paul Erdŏs
,
George Mills
Journal of Combinatorial Theory Series A
30
, 1981, pp. 53-70
The Hillman-Grassl correspondence and the enumeration of reverse plane partitions
Emden R. Gansner
Journal of Combinatorial Theory Series A
30
, 1981, pp. 71-89
Homotopy type of posets and lattice complementation
Anders Björner
Journal of Combinatorial Theory Series A
30
, 1981, pp. 90-100
Supplement to multiplier theorems
Hai-Ping Ko
,
Stuart S.-S. Wang
Journal of Combinatorial Theory Series A
30
, 1981, pp. 101-107
On van der Waerden's theorem and the theorem of Paris and Harrington
T.C. Brown
Journal of Combinatorial Theory Series A
30
, 1981, pp. 108-111
Coloring
n
-sets red and blue
Joel Spencer
Journal of Combinatorial Theory Series A
30
, 1981, pp. 112-113
Every 5-coloured map in the plane contains a monochrome unit
S.P. Townsend
Journal of Combinatorial Theory Series A
30
, 1981, pp. 114-115
On positional games
József Beck
Journal of Combinatorial Theory Series A
30
, 1981, pp. 117-133
Multiplier theorems
Hai-Ping Ko
,
Dijen K. Ray-Chaudhuri
Journal of Combinatorial Theory Series A
30
, 1981, pp. 134-157
A combinatorial theorem
A. Tsarpalias
Journal of Combinatorial Theory Series A
30
, 1981, pp. 158-168
On a problem of Chvátal and Erdŏs on hypergraphs containing no generalized simplex
Peter Frankl
Journal of Combinatorial Theory Series A
30
, 1981, pp. 169-182
String overlaps, pattern matching, and nontransitive games
L.J. Guibas
,
A.M. Odlyzko
Journal of Combinatorial Theory Series A
30
, 1981, pp. 183-208
The nonexistence of a certain Steiner system
S(3,12,112)
N.J.A. Sloane
,
J.G. Thompson
Journal of Combinatorial Theory Series A
30
, 1981, pp. 209-236
Some connections between the Littlewood-Richardson rule and the construction of Schensted
Dennis E. White
Journal of Combinatorial Theory Series A
30
, 1981, pp. 237-247
A cycle index sum inversion theorem
Phil Hanlon
Journal of Combinatorial Theory Series A
30
, 1981, pp. 248-269
Generalized Hadamard matrices and related matrices and their applications to the construction of the positive definite integral Hermitian forms
Michio Ozeki
Journal of Combinatorial Theory Series A
30
, 1981, pp. 270-275
A partially ordered set and
q
-Krawtchouk polynomials
Dennis Stanton
Journal of Combinatorial Theory Series A
30
, 1981, pp. 276-284
The geometric structure and the
p
-rank of an affine triple system derived from a nonassociative Moufang loop with the maximum associative center
Noburu Hamada
Journal of Combinatorial Theory Series A
30
, 1981, pp. 285-297
On Sperner families in which no
k
sets have an empty intersection, II
Hans-Dietrich O.F. Gronau
Journal of Combinatorial Theory Series A
30
, 1981, pp. 298-316
An expression for the number of equivalence classes of Latin squares under row and column permutations
Charles Laywine
Journal of Combinatorial Theory Series A
30
, 1981, pp. 317-320
A constructive proof of Tucker's combinatorial lemma
Robert M. Freund
,
Michael J. Todd
Journal of Combinatorial Theory Series A
30
, 1981, pp. 321-325
On the number of disjoint Mendelsohn triple systems
C.C. Lindner
Journal of Combinatorial Theory Series A
30
, 1981, pp. 326-330
Seiten 1
2
>