Vojtech Rödl
Computational Theory and Mathematics · 2003–2016
A researcher in the Science corpus: 11 papers; trusts 8 researchers and is trusted by 26 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 19 citations into it; #1,168 of 12,182 by trust here, #2,104 by citations
- Discrete Mathematics and Combinatorics — 12 citations into it; #95 of 2,017 by trust here, #110 by citations
- Geometry and Topology — 12 citations into it; #1,293 of 7,422 by trust here, #1,739 by citations
- Algorithms & Complexity — 5 citations into it
- Network Science & Complex Systems — 5 citations into it
Whom Vojtech Rödl trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Johan Wästlund
- Alan M. Frieze
- William T. Gowers
- Andrzej Rucinski
- L. Lov'asz
- Endre Szemerédi
- Béla Bollobás
- Svante Janson
- Jozef Skokan
- Noga Alon
Who trusts Vojtech Rödl overall
- Peter Keevash
- D. Kühn
- William T. Gowers
- Terence Tao
- David Conlon
- L. Lov'asz
- Yi Zhao
- Ben Joseph Green
- Allan Siu Lun Lo
- Stefan Glock
Papers from Vojtech Rödl's perspective
Ordered by how strongly the researchers Vojtech Rödl trusts endorse each paper. Same corpus, a different order for every researcher.
- Generalization of the Borel-Cantelli Lemma
- Recent advances on Dirac-type problems for hypergraphs
- Graphs and Hypergraphs (Clustering)
- The Probabilistic Method
- The Diameter of a Scale-Free Random Graph (Comb.)
- Mathematical results on scale‐free random graphs
- Statistical mechanics of complex networks
- Robustness and Vulnerability of Scale-Free Random Graphs (Internet Mathematics)
- Limits of dense graph sequences (J. Comb. Theory B)
- Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities
Their papers
- Regularity Lemma for k‐uniform hypergraphs (2004) — 301 citations
- Szemerédi’s Regularity Lemma and Quasi-randomness (2003) — 98 citations
- Regularity Lemmas for Graphs (2010) — 58 citations
- A Dirac-Type Theorem for 3-Uniform Hypergraphs (2006) — 303 citations
- Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve) (2010) — 172 citations
- Sparse partition universal graphs for graphs of bounded degree (2011) — 58 citations
- Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs (2011) — 98 citations
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs (2016) — 57 citations
- Measures of pseudorandomness for finite sequences: typical values (2007) — 77 citations
- The counting lemma for regular k-uniform hypergraphs (2006) — 97 citations
- Pseudorandom sets and explicit constructions of ramsey graphs (2004) — 51 citations