474:
487:
540:
480:
176:
620:
610:
581:
524:
371:
346:
605:
600:
351:
55:
574:
59:
332:
640:
517:
635:
567:
510:
286:
227:
51:
79:
615:
197:
555:
498:
204:
143:
630:
43:
340:
66:
625:
353:
8:
438:
390:
47:
385:
366:
111:
430:
300:
281:
262:
257:
240:
203:
He proved an upper bound on the ratio between the fractional matching number and the
39:
442:
422:
380:
328:
295:
252:
118:
31:
193:
122:
551:
494:
594:
547:
434:
316:
266:
126:
35:
223:
95:
83:
110:-dimensional space such that all triangles formed from those points are
78:
In infinitely many cases he determined the maximum number of edges in a
426:
394:
458:
314:
69:
degree in mathematics in 1981 from the
Hungarian Academy of Sciences.
410:
486:
333:
10.1002/(sici)1520-6610(1996)4:1<5::aid-jcd2>3.3.co;2-w
23:
473:
186:
27:
411:"Maximum degree and fractional matchings in uniform hypergraphs"
539:
58:
of the
Hungarian Academy of Sciences, and a professor at the
479:
185:
In a paper written with coauthors he solved the
Hungarian
367:"Arrangements of lines with a large number of triangles"
282:"The maximum number of unit distances in a convex n-gon"
146:
232:
200:of finding sets of points with many 3-point lines.
170:
319:, and Z. Zubor (1996). "On the lottery problem".
592:
372:Proceedings of the American Mathematical Society
621:University of Illinois Urbana-Champaign faculty
493:This article about a Hungarian scientist is a
575:
518:
364:
611:Members of the Hungarian Academy of Sciences
345:: CS1 maint: multiple names: authors list (
196:he found the best known lower bounds on the
582:
568:
525:
511:
54:(2004). He is a research professor of the
384:
299:
279:
256:
245:Journal of Combinatorial Theory, Series B
60:University of Illinois Urbana-Champaign
593:
408:
238:
50:. He is a corresponding member of the
606:21st-century Hungarian mathematicians
601:20th-century Hungarian mathematicians
534:
467:
125:algorithm determines the volume of
13:
14:
652:
452:
386:10.1090/S0002-9939-1984-0760946-2
140:He proved that there are at most
538:
485:
478:
472:
365:Füredi, Z.; Palásti, I. (1984).
321:Journal of Combinatorial Designs
287:Journal of Combinatorial Theory
241:"Graphs without quadrilaterals"
205:matching number in a hypergraph
72:
546:This article about a European
409:Füredi, Zoltán (1 June 1981).
402:
358:
308:
273:
217:
165:
150:
133:within a multiplicative error
1:
228:Mathematics Genealogy Project
211:
52:Hungarian Academy of Sciences
641:European mathematician stubs
554:. You can help Knowledge by
497:. You can help Knowledge by
301:10.1016/0097-3165(90)90074-7
258:10.1016/0095-8956(83)90018-7
56:Rényi Mathematical Institute
7:
251:(2). Elsevier BV: 187–190.
178:unit distances in a convex
10:
657:
533:
466:
171:{\displaystyle O(n\log n)}
34:mathematician, working in
636:Hungarian scientist stubs
198:orchard-planting problem
98:he proved that for some
459:Füredi's UIUC home page
239:Füredi, Zoltán (1983).
16:Hungarian mathematician
172:
46:. He was a student of
44:extremal combinatorics
173:
67:Candidate of Sciences
144:
65:Füredi received his
30:, 21 May 1954) is a
427:10.1007/BF02579271
280:Z. Füredi (1990).
168:
121:he proved that no
48:Gyula O. H. Katona
616:Combinatorialists
563:
562:
506:
505:
102:>1, there are
40:discrete geometry
648:
584:
577:
570:
542:
535:
527:
520:
513:
489:
484:
483:
482:
476:
468:
447:
446:
406:
400:
398:
388:
362:
356:
350:
344:
336:
312:
306:
305:
303:
277:
271:
270:
260:
236:
230:
221:
177:
175:
174:
169:
656:
655:
651:
650:
649:
647:
646:
645:
591:
590:
589:
588:
532:
531:
477:
471:
464:
455:
450:
407:
403:
363:
359:
338:
337:
313:
309:
278:
274:
237:
233:
222:
218:
214:
145:
142:
141:
123:polynomial time
89:
75:
17:
12:
11:
5:
654:
644:
643:
638:
633:
628:
623:
618:
613:
608:
603:
587:
586:
579:
572:
564:
561:
560:
543:
530:
529:
522:
515:
507:
504:
503:
490:
462:
461:
454:
453:External links
451:
449:
448:
421:(2): 155–162.
401:
379:(4): 561–566.
357:
307:
294:(2): 316–320.
272:
231:
215:
213:
210:
209:
208:
201:
190:
183:
167:
164:
161:
158:
155:
152:
149:
138:
115:
92:
87:
74:
71:
15:
9:
6:
4:
3:
2:
653:
642:
639:
637:
634:
632:
631:Living people
629:
627:
624:
622:
619:
617:
614:
612:
609:
607:
604:
602:
599:
598:
596:
585:
580:
578:
573:
571:
566:
565:
559:
557:
553:
549:
548:mathematician
544:
541:
537:
536:
528:
523:
521:
516:
514:
509:
508:
502:
500:
496:
491:
488:
481:
475:
470:
469:
465:
460:
457:
456:
444:
440:
436:
432:
428:
424:
420:
416:
415:Combinatorica
412:
405:
396:
392:
387:
382:
378:
374:
373:
368:
361:
355:
352:
348:
342:
334:
330:
326:
322:
318:
317:G. J. Székely
311:
302:
297:
293:
289:
288:
283:
276:
268:
264:
259:
254:
250:
246:
242:
235:
229:
225:
224:Zoltán Füredi
220:
216:
206:
202:
199:
195:
194:Ilona Palásti
191:
188:
184:
181:
162:
159:
156:
153:
147:
139:
136:
132:
129:in dimension
128:
127:convex bodies
124:
120:
116:
113:
109:
105:
101:
97:
93:
90:
86:
81:
77:
76:
70:
68:
63:
61:
57:
53:
49:
45:
41:
37:
36:combinatorics
33:
29:
25:
21:
20:Zoltán Füredi
556:expanding it
545:
499:expanding it
492:
463:
418:
414:
404:
376:
370:
360:
341:cite journal
324:
320:
310:
291:
290:. Series A.
285:
275:
248:
244:
234:
219:
179:
134:
130:
107:
103:
99:
84:
73:Some results
64:
38:, mainly in
19:
18:
626:1954 births
327:(1): 5–10.
315:Z. Füredi,
119:Imre Bárány
595:Categories
212:References
106:points in
96:Paul Erdős
435:1439-6912
267:0095-8956
160:
32:Hungarian
443:10530732
189:problem.
82:with no
62:(UIUC).
24:Budapest
395:2045427
354:Reprint
226:at the
187:lottery
28:Hungary
441:
433:
393:
265:
550:is a
439:S2CID
391:JSTOR
192:With
182:-gon.
117:With
112:acute
94:With
80:graph
552:stub
495:stub
431:ISSN
347:link
263:ISSN
42:and
423:doi
381:doi
329:doi
296:doi
253:doi
157:log
597::
437:.
429:.
417:.
413:.
389:.
377:92
375:.
369:.
343:}}
339:{{
323:.
292:55
284:.
261:.
249:34
247:.
243:.
26:,
583:e
576:t
569:v
558:.
526:e
519:t
512:v
501:.
445:.
425::
419:1
399:.
397:.
383::
349:)
335:.
331::
325:4
304:.
298::
269:.
255::
207:.
180:n
166:)
163:n
154:n
151:(
148:O
137:.
135:d
131:d
114:.
108:d
104:c
100:c
91:.
88:4
85:C
22:(
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.