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=41
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Path generating functions and continued fractions
I.P. Goulden
,
D.M. Jackson
Journal of Combinatorial Theory Series A
41
, 1986, pp. 1-10
A method for constructing generalised residual designs
C.E. Lloyd
Journal of Combinatorial Theory Series A
41
, 1986, pp. 11-20
Distributions, continued fractions, and the Ehrenfest urn model
I.P. Goulden
,
D.M. Jackson
Journal of Combinatorial Theory Series A
41
, 1986, pp. 21-31
On the minimum rank of regular classes of matrices of zeros and ones
Richard A. Brualdi
,
Rachel Manber
,
Jeffrey A. Ross
Journal of Combinatorial Theory Series A
41
, 1986, pp. 32-49
A generalisation of Canfield's formula
Edward A. Bender
,
L. Bruce Richmond
Journal of Combinatorial Theory Series A
41
, 1986, pp. 50-60
The number of repeated blocks in twofold triple systems
Alexander Rosa
,
Dean Hoffman
Journal of Combinatorial Theory Series A
41
, 1986, pp. 61-88
An improved lower bound on the greatest element of a sum-distinct set of fixed order
Noam D. Elkies
Journal of Combinatorial Theory Series A
41
, 1986, pp. 89-94
A canonical version for partition regular systems of linear equations
Hanno Lefmann
Journal of Combinatorial Theory Series A
41
, 1986, pp. 95-104
``Poly-unsaturated'' posets: The Greene-Kleitman theorem is best possible
Douglas B. West
Journal of Combinatorial Theory Series A
41
, 1986, pp. 105-116
Covering triples by quadruples: An asymptotic solution
A. Hartman
,
W.H. Mills
,
R.C. Mullin
Journal of Combinatorial Theory Series A
41
, 1986, pp. 117-138
Decomposition of the complete hypergraph into delta-systems II
A.F. Mouyart
,
F. Sterboul
Journal of Combinatorial Theory Series A
41
, 1986, pp. 139-149
Non-trivial intersecting families
P. Frankl
,
Z. Füredi
Journal of Combinatorial Theory Series A
41
, 1986, pp. 150-153
The number of small semispaces of a finite set of points in the plane
Noga Alon
,
E. Györi
Journal of Combinatorial Theory Series A
41
, 1986, pp. 154-157
On the maximal number of edges of many faces in an arrangement
H. Edelsbrunner
,
E. Welzl
Journal of Combinatorial Theory Series A
41
, 1986, pp. 159-166
Characterization of
f
-vectors of families of convex sets in
R^d
. Part II: Sufficiency of Eckhoff's conditions
Gil Kalai
Journal of Combinatorial Theory Series A
41
, 1986, pp. 167-188
Characterization of projective planes of small prime orders
Chat Yin Ho
Journal of Combinatorial Theory Series A
41
, 1986, pp. 189-220
On the cuts and cut number of the 4-cube
M.R. Emamy-Khansary
Journal of Combinatorial Theory Series A
41
, 1986, pp. 221-227
The extension to root systems of a theorem on tournaments
A.R. Calderbank
,
Phil Hanlon
Journal of Combinatorial Theory Series A
41
, 1986, pp. 228-245
Q
-counting Rook configurations and a formula of Frobenius
A.M. Garsia
,
J.B. Remmel
Journal of Combinatorial Theory Series A
41
, 1986, pp. 246-275
Answers to two questions about semi-symmetric designs
Zvonimir Janko
,
Tran van Trung
Journal of Combinatorial Theory Series A
41
, 1986, pp. 276-277
On growing a random Young tableau
B. Pittel
Journal of Combinatorial Theory Series A
41
, 1986, pp. 278-285