Z. Furedi

Computational Theory and Mathematics · 2005–2013

A researcher in the Science corpus: 3 papers; trusts 8 researchers and is trusted by 4 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 11 citations into it; #6,639 of 12,182 by trust here, #7,851 by citations
• Discrete Mathematics and Combinatorics — 10 citations into it; #1,073 of 2,017 by trust here, #970 by citations
• Geometry and Topology — 7 citations into it; #5,363 of 7,422 by trust here, #5,351 by citations
• Algorithms & Complexity — 5 citations into it

Whom Z. Furedi trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Hamed Hatami
2. Miklós Simonovits
3. Vladimir Nikiforov
4. Andries E. Brouwer
5. Assaf Naor
6. Willem H. Haemers
7. Jacques Verstraëte
8. Oleg Pikhurko
9. Bruce A. Reed
10. Adam W. Marcus

Who trusts Z. Furedi overall

1. Peter Keevash
2. Robert Morris
3. Jacques Verstraëte
4. Dheer Noal Desai
5. Yongtao Li
6. David Saxton
7. Liying Kang
8. Boris Bukh
9. Assaf Naor

Papers from Z. Furedi's perspective

Ordered by how strongly the researchers Z. Furedi trusts endorse each paper. Same corpus, a different order for every researcher.

1. On the Turán number for the hexagon
2. Bounds on graph eigenvalues II
3. An Approximate Version of Sidorenko’s Conjecture
4. A note on the Turán function of even cycles
5. Undecidability of linear inequalities in graph homomorphism densities
6. Graph norms and Sidorenko’s conjecture
7. Some extremal problems in graph theory
8. A Note on Bipartite Graphs Without 2k-Cycles (Combinatorics, probability & computing)
9. Spectra of Graphs
10. Excluded permutation matrices and the Stanley-Wilf conjecture (Journal of Combinatorial Theory)

Their papers

• On the Turán number for the hexagon (2006) — 67 citations
• On Triple Systems with Independent Neighbourhoods (2005) — 57 citations
• The History of Degenerate (Bipartite) Extremal Graph Problems (2013) — 438 citations