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="{\L}uczak, T."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The Ramsey number for hypergraph cycles I
P.E. Haxell
,
T. Łuczak
,
Y. Peng
,
V. Rödl
,
A. Ruciński
,
M. Simonovits
,
J. Skokan
Journal of Combinatorial Theory Series A
113
(1), 2006, pp. 67-83
Ramsey numbers for trees of small maximum degree
P.E. Haxell
,
T. Łuczak
,
P.W. Tingley
Combinatorica
22
(2), 2002, pp. 287-320
On
K^4
-free subgraphs of random graphs
Y. Kohayakawa
,
T. Łuczak
,
V. Rödl
Combinatorica
17
(2), 1997, pp. 173-213
Turán's extremal problem in random graphs: Forbidding odd cycles
P.E. Haxell
,
Y. Kohayakawa
,
T. Łuczak
Combinatorica
16
(1), 1996, pp. 107-122
Turán's extremal problem in random graphs: Forbidding even cycles
P.E. Haxell
,
Y. Kohayakawa
,
T. Łuczak
Journal of Combinatorial Theory Series B
64
(2), 1995, pp. 273-287
On the independence and chromatic numbers of random regular graphs
A.M. Frieze
,
T. Łuczak
Journal of Combinatorial Theory Series B
54
, 1992, pp. 123-132