海量图书期刊资源,随时随地畅享阅读乐趣
On the lottery problemZoltán Füredi; Gábor J. Székely; Zoltán Zubor · 1996
Computing the volume is difficultImre Bárány; Zoltán Füredi · Discrete and Computational Geometry · 1987
Empty Simplices in Euclidean SpaceBárány, Imre; Füredi, Zoltán · Canadian Mathematical Bulletin · 1987
The grid revistedPaul Erdős; Zoltán Füredi; János Pach; Imre Z. Ruzsa · 1993
Guest Editors’ ForewordZoltán Füredi; Ervin Győri; János Pach; Attila Sali · 2008
Subtended anglesPaul Balister,Zoltán Füredi,Béla Bollobás,Imre Leader… · Israel Journal of Mathematics · 2016
Moments of graphs in monotone familiesZoltán Füredi; André Kündgen · 2006
Connected matchings and Hadwiger's conjectureFÜREDI, ZOLTÁN; GYÁRFÁS, ANDRÁS; SIMONYI, GÁBOR · Combinatorics, Probability and Computing · 2005
Diametric theorems in sequence spacesR. Ahlswede; N. Cai; Z. Zhang · Combinatorica · 1992
Small transversals in hypergraphsV. Chvátal; C. McDiarmid · Combinatorica · 1992
On integer points in polyhedraW. Cook; M. Hartmann; R. Kannan; C. McDiarmid · Combinatorica · 1992
Spanning trees of extended graphsA. K. Kelmans · Combinatorica · 1992
On rank vs. communication complexityNoam Nisan; Avi Wigderson · Combinatorica · 1995
Colouring a graph frugallyHugh Hind; Michael Molloy; Bruce Reed · Combinatorica · 1997
Expanding graphs and invariant meansYehuda Shalom · Combinatorica · 1997
Universally signable graphsMichele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vušković · Combinatorica · 1997