Wojciech Samotij

According to our database1, Wojciech Samotij authored at least 24 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Largest subgraph from a hereditary property in a random graph.
Discret. Math., September, 2023

2020
A generalized Turán problem in random graphs.
Random Struct. Algorithms, 2020

Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties.
Comb. Probab. Comput., 2020

2019
Packing trees of unbounded degrees in random graphs.
J. Lond. Math. Soc., 2019

2016
The number of B<sub>3</sub>-sets of a given cardinality.
J. Comb. Theory A, 2016

On the Number of <i>B<sub>h</sub> </i>-Sets.
Comb. Probab. Comput., 2016

2015
Smoothed Analysis on Connected Graphs.
SIAM J. Discret. Math., 2015

The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers.
Random Struct. Algorithms, 2015

On the number of monotone sequences.
J. Comb. Theory B, 2015

Counting independent sets in graphs.
Eur. J. Comb., 2015

2014
Stability results for random discrete structures.
Random Struct. Algorithms, 2014

Long Paths and Cycles in Random Subgraphs of $\mathcal{H}$-free Graphs.
Electron. J. Comb., 2014

2013
Lipschitz Functions on Expanders are Typically Flat.
Comb. Probab. Comput., 2013

Expanders Are Universal for the Class of All Spanning Trees.
Comb. Probab. Comput., 2013

2012
Optimal Packings of Hamilton Cycles in Sparse Random Graphs.
SIAM J. Discret. Math., 2012

Pancyclic subgraphs of random graphs.
J. Graph Theory, 2012

Corrádi and Hajnal's Theorem for Sparse Random Graphs.
Comb. Probab. Comput., 2012

2011
Local resilience of almost spanning trees in random graphs.
Random Struct. Algorithms, 2011

The number of <i>K</i><sub><i>s, t</i></sub>-free graphs.
J. Lond. Math. Soc., 2011

On the Chvátal-Erdös Triangle Game.
Electron. J. Comb., 2011

The number of <i>K</i><sub><i>m, m</i></sub>-free graphs.
Comb., 2011

2010
Almost All C<sub>4</sub>-Free Graphs Have Fewer than (1-epsilon), ex(n, C<sub>4</sub>) Edges.
SIAM J. Discret. Math., 2010

Large Bounded Degree Trees in Expanding Graphs.
Electron. J. Comb., 2010

2009
Sizes of Induced Subgraphs of Ramsey Graphs.
Comb. Probab. Comput., 2009


  Loading...