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: Author="Sauer, N."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Partitions and indivisibility properties of countable dimensional vector spaces
C. Laflamme
,
L. Nguyen Van Thé
,
M. Pouzet
,
N. Sauer
Journal of Combinatorial Theory Series A
118
(1), 2011, pp. 67-77
Canonical partitions of universal structures
C. Laflamme
,
N.W. Sauer
,
V. Vuksanovic
Combinatorica
26
(2), 2006, pp. 183-205
Coloring subgraphs of the Rado graph
N.W. Sauer
Combinatorica
26
(2), 2006, pp. 231-253
Ramsey families which exclude a graph
V. Rödl
,
N. Sauer
,
X. Zhu
Combinatorica
15
(4), 1995, pp. 589-596
On the divisibility of homogeneous hypergraphs
M. El-Zahar
,
N. Sauer
Combinatorica
14
(2), 1994, pp. 159-165
Inexhaustible homogeneous structures
K. Böröczky
,
N. Sauer
,
X. Zhu
Discrete Mathematics
115
(1-3), 1993, pp. 57-63
Cut-sets in infinite graphs and partial orders
A. Hajnal
,
N. Sauer
Discrete Mathematics
117
(1-3), 1993, pp. 113-125
An approach to Hedetniemi's conjecture
N.W. Sauer
,
X. Zhu
Journal of Graph Theory
16
(5), 1992, pp. 423-436
Two-colouring all two-element maximal antichains
D. Duffus
,
B. Sands
,
N. Sauer
,
R.E. Woodrow
Journal of Combinatorial Theory Series A
57
, 1991, pp. 109-116
The indivisibility of the homogeneous
K_n
-free graphs
M. El-Zahar
,
N. Sauer
Journal of Combinatorial Theory Series B
47
, 1989, pp. 162-170
The chromatic number of the product of two 4-chromatic graphs is 4
M. El-Zahar
,
N.W. Sauer
Combinatorica
5
, 1985, pp. 121-126
On monochromatic paths in edge coloured digraphs
B. Sands
,
N. Sauer
,
R. Woodrow
Journal of Combinatorial Theory Series B
33
(3), 1982, December, pp. 271-275
On the factorization of the complete graph
N. Sauer
,
J. Schaer
Journal of Combinatorial Theory Series B
14
, 1973, pp. 1-6
Intersection theorems for systems of sets
H.L. Abbott
,
D. Hanson
,
N. Sauer
Journal of Combinatorial Theory Series A
12
, 1972, pp. 381-389
On the density of families of sets
N. Sauer
Journal of Combinatorial Theory Series A
13
, 1972, pp. 145-147
A generalization of a theorem of Turán
N. Sauer
Journal of Combinatorial Theory Series B
10
, 1971, pp. 109-112
On the existence of regular
n
-graphs with given girth
N. Sauer
Journal of Combinatorial Theory
9
, 1970, pp. 144-147