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=102
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Disjointly representing set systems
Béla Bollobás
,
Oliver Riordan
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 1-9
Zero-patterns of polynomials and Newton polytopes
Alan G.B. Lauder
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 10-15
Gonc̑arov polynomials and parking functions
Joseph P.S. Kung
,
Catherine Yan
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 16-37
Inequalities involving the Delandtsheer-Doyen parameters for finite line-transitive linear spaces
Cheryl E. Praeger
,
Ngo Dac Tuan
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 38-62
Bell numbers, their relatives, and algebraic differential equations
Martin Klazar
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 63-87
Nerves, fibers and homotopy groups
Anders Björner
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 88-93
Generating binary spaces
Vsevolod F. Lev
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 94-109
Generalization of Schensted insertion algorithm to the cases of hooks and semi-shuffles
Mikhail Kogan
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 110-135
A model for the dual of the generalised hexagon
H(q), q
odd
Elisabeth Kuijken
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 136-142
Finite Laguerre planes of order 8 are ovoidal
Günter F. Steinke
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 143-162
Bruhat intervals of length 4 in Weyl groups
Axel Hultman
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 163-178
An upper bound on the size of a code with the
k
-identifiable parent property
Simon R. Blackburn
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 179-185
A better upper bound on the number of triangulations of a planar point set
Francisco Santos
,
Raimund Seidel
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 186-193
Embeddings of polar spaces
Gavin J. Seal
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 194-200
More mutually disjoint Steiner systems
S(5,8,24)
Makoto Araya
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 201-203
An improved upper bound for the football pool problem for nine matches
Franco di Pasquale
,
Patric R.J. Östergåard
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 204-206
Maximal Abelian square-free words of short length
Michael Korn
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 207-211
Two injective proofs of a conjecture of Simion
Miklós Bóna
,
Bruce E. Sagan
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 212-216
Combinatorial proofs of generating function identities for
F
-partitions
Ae Ja Yee
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 217-228
On homogeneous sets of positive integers
Vojtȇch Rödl
Journal of Combinatorial Theory Series A
102
(1), 2003, pp. 229-240
On random relational structures
Manfred Droste
,
Dietrich Kuske
Journal of Combinatorial Theory Series A
102
(2), 2003, pp. 241-254
Width and dual width of subsets in polynomial association schemes
A.E. Brouwer
,
C.D. Godsil
,
J.H. Koolen
,
W.J. Martin
Journal of Combinatorial Theory Series A
102
(2), 2003, pp. 255-271
Intransitive collineation groups of ovals fixing a triangle
Angela Aguglia
,
Arrigo Bonisoli
Journal of Combinatorial Theory Series A
102
(2), 2003, pp. 273-282
Characterizations of near hexagons by means of one local space
Bart de Bruyn
Journal of Combinatorial Theory Series A
102
(2), 2003, pp. 283-292
A thin near hexagon with 50 points
Rieuwert Blok
,
Bart de Bruyn
,
Ulrich Meierfankenfeld
Journal of Combinatorial Theory Series A
102
(2), 2003, pp. 293-308
Seiten 1
2
>