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="F{\"u}redi, Z."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimal length test vectors for multiple-fault detection
Z. Füredi
,
R.P. Kurshan
Theoretical Computer Science
315
(1), 2004, pp. 191-208
Hamiltonian Kneser graphs
Ya-Chen Chen
,
Z. Füredi
Combinatorica
22
(1), 2002, pp. 147-149
Embedding of graphs in two-irregular graphs
M. Axenovich
,
Z. Füredi
Journal of Graph Theory
36
(2), 2001, pp. 75-83
Nonexistence of universal graphs without some trees
Z. Füredi
,
P. Komjáth
Combinatorica
17
(2), 1997, pp. 163-171
Extremal graphs for intersecting trinagles
P. Erdös
,
Z. Füredi
,
R.J. Gould
,
D.S. Gunderson
Journal of Combinatorial Theory Series B
64
(1), 1995, pp. 89-100
Graphs of prescribed girth and bi-degree
Z. Füredi
,
F. Lazebnik
,
Á. Seress
,
V.A. Ustimenko
,
A.J. Woldar
Journal of Combinatorial Theory Series B
64
(2), 1995, pp. 228-239
On the fractional matching polytope of a hypergraph
Z. Füredi
,
J. Kahn
,
P.D. Seymour
Combinatorica
13
(2), 1993, pp. 167-180
On the number of halving planes
I. Bárány
,
Z. Füredi
,
L. Lovász
Combinatorica
10
, 1990, pp. 175-183
Covering pairs by
q^2+q+1
sets
Z. Füredi
Journal of Combinatorial Theory Series A
54
, 1990, pp. 248-271
Legitimate colorings of projective planes
N. Alon
,
Z. Füredi
Graphs and Combinatorics
5
, 1989, pp. 95-106
Extremal problems whose solutions are the blowups of the small Witt-designs
P. Frankl
,
Z. Füredi
Journal of Combinatorial Theory Series A
52
, 1989, pp. 129-147
On the fractional covering number of hypergraphs
F.R.K. Chung
,
Z. Füredi
,
M.R. Garey
,
R.L. Graham
SIAM Journal on Discrete Mathematics
1
, 1988, pp. 45-49
On the kernel of intersecting families
Noga Alon
,
Z. Füredi
Graphs and Combinatorics
3
, 1987, pp. 91-94
Bounding one-way differences
P. Frankl
,
Z. Füredi
,
J. Pach
Graphs and Combinatorics
3
, 1987, pp. 341-347
Exact solution of some Turán-type problems
P. Frankl
,
Z. Füredi
Journal of Combinatorial Theory Series A
45
, 1987, pp. 226-262
Colouring finite incidence structures
J. Csima
,
Z. Füredi
Graphs and Combinatorics
2
, 1986, pp. 339-346
Extremal problems concerning Kneser graphs
P. Frankl
,
Z. Füredi
Journal of Combinatorial Theory Series B
40
(3), 1986, June, pp. 270-284
Finite projective spaces and intersecting hypergraphs
P. Frankl
,
Z. Füredi
Combinatorica
6
(4), 1986, pp. 335-354
Non-trivial intersecting families
P. Frankl
,
Z. Füredi
Journal of Combinatorial Theory Series A
41
, 1986, pp. 150-153
Families of finite sets with minimum shadows
Z. Füredi
,
J.R. Griggs
Combinatorica
6
(4), 1986, pp. 355-364
t
-expansive and
t
-wise intersecting hypergraphs
Z. Füredi
Graphs and Combinatorics
2
, 1986, pp. 67-80
Research problems - The chromatic index of simple hypergraphs
Z. Füredi
Graphs and Combinatorics
2
, 1986, pp. 89-92
Minimum matrix representation of closure operations
J. Demetrovics
,
Z. Füredi
,
G.O.H. Katona
Discrete Applied Mathematics
11
, 1985, pp. 115-128
A Ramsey-Sperner theorem
Z. Füredi
Graphs and Combinatorics
1
, 1985, pp. 51-56
Set systems with three intersections
Z. Füredi
Combinatorica
5
, 1985, pp. 27-31
Seiten 1
2
>