Miklós Simonovits

Computational Theory and Mathematics · 2004–2013

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

Subfields

• Computational Theory and Mathematics — 12 citations into it; #10,135 of 12,182 by trust here, #10,901 by citations
• Discrete Mathematics and Combinatorics — 10 citations into it; #1,628 of 2,017 by trust here, #1,692 by citations
• Geometry and Topology — 8 citations into it
• Algorithms & Complexity — 5 citations into it

Whom Miklós Simonovits trusts overall

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

1. Hamed Hatami
2. Vladimir Nikiforov
3. Andries E. Brouwer
4. Willem H. Haemers

Who trusts Miklós Simonovits overall

1. Oliver Janzer
2. Z. Furedi
3. Peter Keevash
4. Tom Bohman
5. Dheer Noal Desai

Papers from Miklós Simonovits's perspective

Ordered by how strongly the researchers Miklós Simonovits trusts endorse each paper. Same corpus, a different order for every researcher.

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

Their papers

• On Triple Systems with Independent Neighbourhoods (2005) — 57 citations
• The History of Degenerate (Bipartite) Extremal Graph Problems (2013) — 438 citations
• Some extremal problems in graph theory (2004) — 48 citations