Oleg Pikhurko
Computational Theory and Mathematics · 2005–2012
A researcher in the Science corpus: 5 papers; trusts 12 researchers and is trusted by 8 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 12 citations into it; #4,180 of 12,182 by trust here, #8,756 by citations
- Discrete Mathematics and Combinatorics — 11 citations into it; #627 of 2,017 by trust here, #1,149 by citations
- Geometry and Topology — 10 citations into it
Whom Oleg Pikhurko trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- László Babai
- Gábor Elek
- Balázs Szegedy
- Alexander A. Razborov
- Jin-Yi Cai
- L. Lov'asz
- Eugene M. Luks
- Hamed Hatami
- Martin Fürer
- Peter Keevash
Who trusts Oleg Pikhurko overall
Papers from Oleg Pikhurko's perspective
Ordered by how strongly the researchers Oleg Pikhurko trusts endorse each paper. Same corpus, a different order for every researcher.
- Random Graph Isomorphism
- Limits of dense graph sequences (J. Comb. Theory B)
- A measure-theoretic approach to the theory of dense hypergraphs
- Canonical labeling of graphs
- Flag algebras (Journal of Symbolic Logic (JSL))
- Undecidability of linear inequalities in graph homomorphism densities
- Graphs on Surfaces (Johns Hopkins series in the mathematical sciences)
- An optimal lower bound on the number of variables for graph identification
- Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
- Automorphism groups, isomorphism, reconstruction
Their papers
- A note on the Turán function of even cycles (2012) — 69 citations
- On Triple Systems with Independent Neighbourhoods (2005) — 57 citations
- ON possible Turán densities (2012) — 50 citations
- Quasirandom permutations are characterized by 4-point densities (2012) — 74 citations
- Logical complexity of graphs: a survey (2010) — 31 citations