Daniel Král'
Discrete Mathematics and Combinatorics · with Esperet · 2008–2013
A researcher in the Science corpus: 4 papers; trusts 8 researchers and is trusted by 5 researchers here, as inferred from the citation graph.
Subfields
- Discrete Mathematics and Combinatorics — 11 citations into it; #1,170 of 2,017 by trust here, #1,552 by citations
- Computational Theory and Mathematics — 10 citations into it; #7,363 of 12,182 by trust here, #10,349 by citations
- Geometry and Topology — 10 citations into it
Whom Daniel Král' trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- William T. Gowers
- L. Lov'asz
- Alexander A. Razborov
- Balázs Szegedy
- Christian Borgs
- Jennifer Tour Chayes
Who trusts Daniel Král' overall
Papers from Daniel Král''s perspective
Ordered by how strongly the researchers Daniel Král' trusts endorse each paper. Same corpus, a different order for every researcher.
- Limits of dense graph sequences (J. Comb. Theory B)
- Flag algebras (Journal of Symbolic Logic (JSL))
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics
- The Complexity of Computing the Permanent
- Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing
- The Probabilistic Method
- An Approximate Version of Sidorenko’s Conjecture
- The number of cliques in graphs of given order and size
- Emergence of Scaling in Random Networks
Their papers
- A removal lemma for systems of linear equations over finite fields (2008) — 74 citations
- A problem of Erdős and Sós on 3-graphs (2013) — 58 citations
- Quasirandom permutations are characterized by 4-point densities (2012) — 74 citations
- Exponentially many perfect matchings in cubic graphs (2010) — 63 citations