Stanislaw P. Radziszowski
Discrete Mathematics and Combinatorics · 2011
A researcher in the Science corpus: 1 paper; trusts 5 researchers and is trusted by 4 researchers here, as inferred from the citation graph.
Subfields
- Discrete Mathematics and Combinatorics — 9 citations into it; #1,126 of 2,017 by trust here, #1,251 by citations
- Computational Theory and Mathematics — 7 citations into it; #7,067 of 12,182 by trust here, #9,306 by citations
Whom Stanislaw P. Radziszowski trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Stanislaw P. Radziszowski overall
Papers from Stanislaw P. Radziszowski's perspective
Ordered by how strongly the researchers Stanislaw P. Radziszowski trusts endorse each paper. Same corpus, a different order for every researcher.
- The triangle-free process
- A combinatorial problem in geometry
- The Probabilistic Method
- The early evolution of the H-free process
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Random graphs (Wiley-Interscience series in discrete mathematics and optimization)
- A new upper bound for diagonal Ramsey numbers
- Independent sets in hypergraphs
- Hypergraph containers
- Regularity Lemmas for Graphs
Their papers
- Small Ramsey Numbers (2011) — 604 citations