Wojciech Samotij
#19,380
Most Influential Person Now
Polish mathematician
Wojciech Samotij's AcademicInfluence.com Rankings
Wojciech Samotijmathematics Degrees
Mathematics
#1006
World Rank
#1733
Historical Rank
Combinatorics
#31
World Rank
#35
Historical Rank
Measure Theory
#583
World Rank
#813
Historical Rank
Download Badge
Mathematics
Wojciech Samotij's Degrees
- Masters Mathematics University of Warsaw
- Bachelors Mathematics University of Warsaw
Similar Degrees You Can Earn
Why Is Wojciech Samotij Influential?
(Suggest an Edit or Addition)According to Wikipedia, Wojciech Samotij is a Polish mathematician and an associate professor at the School of Mathematical Sciences at the Tel Aviv University. He is known for his work in combinatorics, additive number theory, Ramsey theory and graph theory.
Wojciech Samotij's Published Works
Published Works
- Independent sets in hypergraphs (2012) (138)
- On the KŁR conjecture in random graphs (2013) (76)
- Local resilience of almost spanning trees in random graphs (2011) (68)
- Optimal Packings of Hamilton Cycles in Sparse Random Graphs (2011) (52)
- THE METHOD OF HYPERGRAPH CONTAINERS (2018) (46)
- Large Bounded Degree Trees in Expanding Graphs (2010) (45)
- Stability results for random discrete structures (2011) (42)
- The number of Ks,t‐free graphs (2011) (42)
- Upper tails via high moments and entropic stability (2019) (40)
- Counting sum-free sets in abelian groups (2012) (38)
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers (2015) (37)
- Counting independent sets in graphs (2014) (35)
- Exponential Decay of Loop Lengths in the Loop O(n) Model with Large n (2014) (34)
- On the counting problem in inverse Littlewood–Offord theory (2019) (32)
- Corrádi and Hajnal's Theorem for Sparse Random Graphs (2012) (31)
- Supersaturated sparse graphs and hypergraphs (2017) (26)
- Smoothed Analysis on Connected Graphs (2013) (25)
- The typical structure of sparse $K_{r+1}$-free graphs (2013) (25)
- A refinement of the Cameron–Erdős conjecture (2012) (25)
- Odd cutsets and the hard-core model on Z^d (2011) (25)
- Expanders Are Universal for the Class of All Spanning Trees (2011) (22)
- The number of Km,m-free graphs (2011) (21)
- Lipschitz Functions on Expanders are Typically Flat (2012) (16)
- Random sum-free subsets of abelian groups (2011) (15)
- Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties (2018) (15)
- On the Chvátal-Erdös Triangle Game (2011) (14)
- Sizes of Induced Subgraphs of Ramsey Graphs (2009) (13)
- Packing trees of unbounded degrees in random graphs (2016) (12)
- The number of additive triples in subsets of abelian groups (2015) (11)
- Grounded Lipschitz functions on trees are typically flat (2013) (11)
- Pancyclic subgraphs of random graphs (2010) (10)
- An efficient container lemma (2019) (10)
- On the Number of Bh-Sets (2015) (8)
- On the probability of nonexistence in binomial subsets (2017) (8)
- The number of Bh ‐sets of a given cardinality (2018) (8)
- An asymmetric container lemma and the structure of graphs with no induced $4$-cycle (2018) (7)
- Subsets of posets minimising the number of chains (2017) (7)
- Long paths and cycles in random subgraphs of H-free graphs (2013) (7)
- On the number of monotone sequences (2014) (7)
- A generalized Turán problem in random graphs (2018) (6)
- Almost All C4-Free Graphs Have Fewer than (1-epsilon), ex(n, C4) Edges (2010) (5)
- What does a typical metric space look like? (2021) (5)
- The number of B3-sets of a given cardinality (2016) (5)
- Odd cutsets and the hard-core model on $\mathbb{Z}^{d}$ (2014) (4)
- Lower tails via relative entropy (2021) (4)
- Almost all C 4-free graphs have fewer than ( 1 − ε ) ex ( n , C 4 ) edges (2010) (4)
- Long Paths and Cycles in Random Subgraphs of $\mathcal{H}$-free Graphs (2014) (3)
- Almost all C 4-free graphs have less than ( 1 − ε ) ex ( n , C 4 ) edges (2009) (2)
- Exponential Decay of Loop Lengths in the Loop O(n) Model with Large n (2016) (2)
- Counting sum-free sets in abelian groups (2013) (2)
- Sharp thresholds for Ramsey properties (2022) (1)
- Random sum-free subsets of abelian groups (2013) (0)
- Submitted to the Annals of Probability ON THE PROBABILITY OF NONEXISTENCE IN BINOMIAL SUBSETS By (2019) (0)
- Two-round Ramsey games on random graphs (2023) (0)
- C O ] 2 1 M ar 2 01 4 INDEPENDENT SETS IN HYPERGRAPHS (2021) (0)
- On the typical structure of graphs not containing a fixed vertex-critical subgraph (2021) (0)
- On Cameron{Erd}os problem of Sidon sets (2013) (0)
- On the Chvátal-Erdo{double acute}s triangle game (2011) (0)
- Extremal problems in pseudo-random graphs and asymptotic enumeration (2010) (0)
- Corr\'adi and Hajnal's theorem for sparse random graphs (2010) (0)
- Pancyclic subgraphs of random graphs Choongbum Lee (2011) (0)
- Expansion in randomly perturbed connected graphs and its consequences (2013) (0)
- Largest subgraph from a hereditary property in a random graph (2022) (0)
- On the KŁR conjecture in random graphs (2014) (0)
This paper list is powered by the following services:
Other Resources About Wojciech Samotij
What Schools Are Affiliated With Wojciech Samotij?
Wojciech Samotij is affiliated with the following schools: