The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Zoltán Füredi" ( http://dblp.L3S.de/Authors/Zoltán_Füredi )

  Author page on DBLP  Author page in RDF  Community of Zoltán Füredi in ASPL-2

Publication years (Num. hits)
1980-1984 (15) 1985-1986 (15) 1987-1989 (19) 1990-1991 (15) 1992-1995 (15) 1996-2000 (15) 2001-2005 (20) 2006-2009 (16) 2010-2012 (10)
Publication types (Num. hits)
article(138) inproceedings(2)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 3 occurrences of 3 keywords

Results
Found 140 publication records. Showing 140 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Zoltán Füredi, Attila Sali Some new bounds on partition critical hypergraphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós Large Bd-Free and Union-free Subfamilies. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Lale Özkahya On even-cycle-free subgraphs of the hypercube. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Lale Özkahya Unavoidable subhypergraphs: a-clusters. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi Linear paths and trees in uniform hypergraphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Younjin Kim Minimum Ck-saturated graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri Reverse-free codes and permutations. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós Large Bd-free and union-free subfamilies. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Jenö Lehel Tight embeddings of partial quadrilateral packings. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri On Reverse-Free Codes and Permutations. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Lale Özkahya Unavoidable subhypergraphs: a-clusters. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Ida Kantor List colorings with distinct list sizes, the case of complete bipartite graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Attila Sali Partition Critical Hypergraphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Lale Özkahya On even-cycle-free subgraphs of the hypercube. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Lale Özkahya On 14-Cycle-Free Subgraphs of the Hypercube. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Dhruv Mubayi, Oleg Pikhurko Quadruple systems with independent neighborhoods. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Ervin Györi, János Pach, Attila Sali Guest Editors' Foreword. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Jeong-Hyun Kang Covering the n-space by convex bodies and its chromatic number. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow Inequalities for the first-fit chromatic number. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Miklós Ruszinkó Large convex cones in hypercubes. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Nancy Eaton, Zoltán Füredi, Alexandr V. Kostochka, Jozef Skokan Tree representations of graphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi Covering a Triangle with Positive and Negative Homothetic Copies. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits 4-Books of three pages. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Robert H. Sloan, Ken Takata, György Turán On set systems with a threshold property. Search on Bibsonomy Discrete Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Gyula O. H. Katona 2-Bases of Quadruples. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, André Kündgen Moments of graphs in monotone families. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Miklós Ruszinkó Large Convex Cones in Hypercubes. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Miklós Simonovits Triple Systems Not Containing a Fano Configuration. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, András Gyárfás, Gábor Simonyi Connected matchings and Hadwiger's conjecture. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Péter L. Erdös, Zoltán Füredi, Gyula O. H. Katona Two-Part and k-Sperner Families: New Proofs Using Permutations. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Ya-Chen Chen, Zoltán Füredi Minimum vertex-diameter-2-critical graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Alexandr V. Kostochka, Riste Skrekovski, Michael Stiebitz, Douglas B. West Nordhaus-Gaddum-type Theorems for decompositions into many parts. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Zsolt Katona Multiply intersecting families of sets. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Benny Sudakov Extremal set systems with restricted k-wise intersections. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Robert P. Kurshan Minimal length test vectors for multiple-fault detection. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Jeong-Hyun Kang Distance graph on Znwith norm. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits The Tura'n Density of the Hypergraph {abc, ade, bde, cde}. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2003 DBLP  BibTeX  RDF
1Maria Axenovich, Zoltán Füredi Exact Bounds on the Sizes of Covering Codes. Search on Bibsonomy Des. Codes Cryptography The full citation details ... 2003 DBLP  DOI  BibTeX  RDF supersaturated hypergraphs, Turán theorem, covering radius, binary codes
1Zoltán Füredi, András Gyárfás, Miklós Ruszinkó On the maximum size of (p, Q)-free families. Search on Bibsonomy Discrete Mathematics The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Ya-Chen Chen, Zoltán Füredi Hamiltonian Kneser Graphs. Search on Bibsonomy Combinatorica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 05C45, 05C38
1Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster Covering Non-uniform Hypergraphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, András Gyárfás, Miklós Ruszinkó On the Maximum Size of (p, Q) - free Families. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Imre Bárány, Zoltán Füredi On the lattice diameter of a convex polygon. Search on Bibsonomy Discrete Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, André Kündgen Covering a graph with cuts of minimum total size. Search on Bibsonomy Discrete Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Douglas B. West Ramsey Theory and Bandwidth of Graphs. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi Maximal t-Critical Linear Hypergraphs. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Maria Axenovich, Zoltán Füredi, Dhruv Mubayi On Generalized Ramsey Theory: The Bipartite Case. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Dominique de Caen, Zoltán Füredi The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Dhruv Mubayi Signed Domination in Regular Graphs and Set-Systems. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós Induced subgraphs of given sizes. Search on Bibsonomy Discrete Mathematics The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Miklós Ruszinkó An Improved Upper Bound of the Rate of Euclidean Superimposed Codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Rodney G. Downey, Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel Difference Sets and Computability Theory. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Peter Horák, Chandra M. Pareek, Xuding Zhu Minimal Oriented Graphs of Diameter 2. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi On the Double Competition Number. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Péter Komjáth Nonexistence of Universal Graphs Without Some Trees. Search on Bibsonomy Combinatorica The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi On the Number of Edges of Quadrilateral-Free Graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi New Asymptotics for Bipartite Turán Numbers. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi On r-Cover-free Families. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi Scrambling permutations and entropy of hypergraphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi An Upper Bound on Zarankiewicz' Problem. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel Difference Sets and Inverting the Difference Operator. Search on Bibsonomy Combinatorica The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Felix Lazebnik, Ákos Seress, Vasiliy A. Ustimenko, Andrew J. Woldar Graphs of Prescribed Girth and Bi-Degree. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi Cross-Intersecting Families of Finite Sets. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1995 DBLP  BibTeX  RDF
1Paul Erdös, Zoltán Füredi, Ronald J. Gould, David S. Gunderson Extremal Graphs for Intersecting Triangles. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi Intersecting designs from linear programming and graphs of diameter two. Search on Bibsonomy Discrete Mathematics The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Michel X. Goemans, Daniel J. Kleitman On the Maximum Number of Triangles in Wheel-Free Graphs. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Daniel J. Kleitman The Prison Yard Problem. Search on Bibsonomy Combinatorica The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa The grid revisted. Search on Bibsonomy Discrete Mathematics The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Noga Alon, Zoltán Füredi Covering the Cube by Affine Hyperplanes. Search on Bibsonomy Eur. J. Comb. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Jeff Kahn, Paul D. Seymour On the fractional matching polytope of a hypergraph. Search on Bibsonomy Combinatorica The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Péter Hajnal Davenport-Schinzel theory of matrices. Search on Bibsonomy Discrete Mathematics The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi Indecomposable regular graphs and hypergraphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Martin E. Dyer, Zoltán Füredi, Colin McDiarmid Volumes Spanned by Random Points in the Hypercube. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman Point Selections and Weak e-Nets for Convex Hulls. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Richard Stanley Sets of vectors with many orthogonal paris. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Noga Alon, Zoltán Füredi Spanning subgraphs of random graphs. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Peter Frankl, Zoltán Füredi Beyond the Erdös-Ko-Rado theorem. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Paul Erdös, Zoltán Füredi, Zsolt Tuza Saturated r-uniform hypergraphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Peter Frankl, Zoltán Füredi A sharpening of Fisher's inequality. Search on Bibsonomy Discrete Mathematics The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi On a Turán type problem of Erdös. Search on Bibsonomy Combinatorica The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi The Densest Packing of Equal Circles into a Parallel Strip. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Paul Erdös, Peter C. Fishburn, Zoltán Füredi Midpoints of Diagonals of Convex n-GONS. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi Maximal Independent Subsets in Steiner Systems and in Planar Sets. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi Covering pairs by q2 + q + 1 sets. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi The maximum number of unit distances in a convex n-gon. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Jerrold R. Griggs, Ron Holzman, Daniel J. Kleitman Representations of families of triples over GF(2). Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Jeff Kahn, Daniel J. Kleitman Sphere coverings of the hypercube with incomparable centers. Search on Bibsonomy Discrete Mathematics The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi Competition Graphs and Clique Dimensions. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi Graphs of diameter 3 with the minimum number of edges. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Imre Bárány, Zoltán Füredi, László Lovász On the number of halving planes. Search on Bibsonomy Combinatorica The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi Perfect error-correcting databases. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Endre Boros, Zoltán Füredi, Jeff Kahn Maximal intersecting families and affine regular polygons in PG(2, q). Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Peter Frankl, Zoltán Füredi Extremal problems whose solutions are the blowups of the small witt-designs. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi Covering the complete graph by partitions. Search on Bibsonomy Discrete Mathematics The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi A projective plane is an outstanding 2-cover. Search on Bibsonomy Discrete Mathematics The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Noga Alon, Zoltán Füredi Legitimate colorings of projective planes. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman A minimal cutset of the boolean lattice with almost all members. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Endre Boros, Zoltán Füredi, L. M. Kelly On Representing Sylvester- Gallai Designs. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman Pair Labeelings with Given Distance. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Imre Bárány, Zoltán Füredi, László Lovász On the Number of Halving Planes. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 140 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.