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
[1]
Hilfe
Suche: Author="Pr{\"o}mel, H.J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
K_4
-free subgraphs of random graphs revisited
S. Gerke
,
H.J. Prömel
,
T. Schickinger
,
A. Steger
,
A. Taraz
Combinatorica
27
(3), 2007, pp. 329-365
Induced Ramsey numbers
Y. Kohayakawa
,
H.J. Prömel
,
V. Rödl
Combinatorica
18
(3), 1998, pp. 373-404
Excluding induced subgraphs II: extremal graphs
H.J. Prömel
,
A. Steger
Discrete Applied Mathematics
44
(1-3), 1993, pp. 283-294
The asymptotic number of graphs not containing a fixed color-critical subgraph
H.J. Prömel
,
A. Steger
Combinatorica
12
(4), 1992, pp. 463-473
A short proof of the restricted Ramsey theorem for finite set systems
H.J. Prömel
,
B. Voigt
Journal of Combinatorial Theory Series A
52
, 1989, pp. 313-320
A dual form of Erdŏs-Rado's canonization theorem
H.J. Prömel
,
S.G. Simpson
,
B. Voigt
Journal of Combinatorial Theory Series A
42
, 1986, pp. 159-178
On the sum of the reciprocals of cycle lengths in sparse graphs
A. Gyárfás
,
H.J. Prömel
,
E. Szemerédi
,
B. Voigt
Combinatorica
5
, 1985, pp. 41-52
Canonizing ordering theorems for Hales Jewett structures
J. Nes̑etȓil
,
H.J. Prömel
,
V. Rödl
,
B. Voigt
Journal of Combinatorial Theory Series A
40
, 1985, pp. 394-408
A canonical partition theorem for equivalence relations on
Z^t
W. Deuber
,
R.L. Graham
,
H.J. Prömel
,
B. Voigt
Journal of Combinatorial Theory Series A
34
, 1983, pp. 331-339
Canonical partition theorems for parameter sets
H.J. Prömel
,
B. Voigt
Journal of Combinatorial Theory Series A
35
, 1983, pp. 309-327