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=Combinatorica AND Volume=17
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Quasi-planar graphs have a linear number of edges
Pankaj K. Agarwal
,
Boris Aronov
,
János Pach
,
Richard Pollack
,
Micha Sharir
Combinatorica
17
(1), 1997, pp. 1-9
Shadows and isoperimetry under the sequence-subsequence relation
Rudolf Ahlswede
,
Ning Cai
Combinatorica
17
(1), 1997, pp. 11-29
Maximal arcs in Desarguesian planes of odd order do not exist
Simeon Ball
,
Aart Blokhuis
,
Francesco Mazzocca
Combinatorica
17
(1), 1997, pp. 31-41
Lie algebras and the four color theorem
Dror Bar-Natan
Combinatorica
17
(1), 1997, pp. 43-52
On
f
-vectors and Betti numbers of multicomplexes
Anders Björner
,
Sinis̑a Vrećica
Combinatorica
17
(1), 1997, pp. 53-65
Universally signable graphs
Michele Conforti
,
Gérard Cornuéjols
,
Ajai Kapoor
,
Kristina Vus̑ković
Combinatorica
17
(1), 1997, pp. 67-77
Randomized graph products, chromatic numbers, and the Lovász
\vartheta
-function
Uriel Feige
Combinatorica
17
(1), 1997, pp. 79-90
On construction of
k
-wise independent random variables
Howard Karloff
,
Yishay Mansour
Combinatorica
17
(1), 1997, pp. 91-107
Blow-up lemma
János Komlós
,
Gábor N. Sárközy
,
Endre Szemerédi
Combinatorica
17
(1), 1997, pp. 109-123
Graph products and monochromatic multiplicities
Andrew Thomason
Combinatorica
17
(1), 1997, pp. 125-134
Multiplicativity of acyclic local tournaments
Huishan Zhou
,
Xuding Zhu
Combinatorica
17
(1), 1997, pp. 135-145
A note on the Beck-Fiala theorem
Debe Bednarchak
,
Martin Helm
Combinatorica
17
(1), 1997, pp. 147-149
Blocking
s
-dimensional subspaces by lines in
PG(2s,q)
J. Eisfeld
,
K. Metsch
Combinatorica
17
(2), 1997, pp. 151-162
Nonexistence of universal graphs without some trees
Z. Füredi
,
P. Komjáth
Combinatorica
17
(2), 1997, pp. 163-171
On
K^4
-free subgraphs of random graphs
Y. Kohayakawa
,
T. Łuczak
,
V. Rödl
Combinatorica
17
(2), 1997, pp. 173-213
Efficient construction of a small hitting set for combinatorial rectangles in high dimension
Nathan Linial
,
Michael Luby
,
Michael Saks
,
David Zuckerman
Combinatorica
17
(2), 1997, pp. 215-234
Projective plane and Möbius band obstructions
Bojan Mohar
Combinatorica
17
(2), 1997, pp. 235-266
A matroid generalization of a result of Dirac
James Oxley
Combinatorica
17
(2), 1997, pp. 267-273
On boundaries and influences
Michel Talagrand
Combinatorica
17
(2), 1997, pp. 275-285
An upper bound on the size of the snake-in-the-box
Gilles Zémor
Combinatorica
17
(2), 1997, pp. 287-298
Counterexample to the Frankl-Pach conjecture for uniform, dense families
R. Ahlswede
,
L.H. Khachatrian
Combinatorica
17
(2), 1997, pp. 299-301
The concentration of the chromatic number of random graphs
Noga Alon
,
Michael Krivelevich
Combinatorica
17
(3), 1997, pp. 303-313
The optimal path-matching problem
William H. Cunningham
,
James F. Geelen
Combinatorica
17
(3), 1997, pp. 315-337
Covering a symmetric poset by symmetric chains
Tamás Fleiner
Combinatorica
17
(3), 1997, pp. 339-344
Polynomials with two values
Joachim von zur Gathen
,
James R. Roche
Combinatorica
17
(3), 1997, pp. 345-362
Seiten 1
2
>