We stand with Ukraine  

Wojciech Samotij

According to our database1, Wojciech Samotij authored at least 25 papers between 2009 and 2024.

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

2024
The List-Ramsey threshold for families of graphs.
[BibTeX]
[DOI]
Eden Kuperwasser
,
Wojciech Samotij
Comb. Probab. Comput., 2024

2023
Largest subgraph from a hereditary property in a random graph.
[BibTeX]
[DOI]
Noga Alon
,
Michael Krivelevich
,
Wojciech Samotij
Discret. Math., September, 2023

2020
A generalized Turán problem in random graphs.
[BibTeX]
[DOI]
Wojciech Samotij
,
Clara Shikhelman
Random Struct. Algorithms, 2020

Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties.
[BibTeX]
[DOI]
Frank Mousset
,
Rajko Nenadov
,
Wojciech Samotij
Comb. Probab. Comput., 2020

2019
Packing trees of unbounded degrees in random graphs.
[BibTeX]
[DOI]
Asaf Ferber
,
Wojciech Samotij
J. Lond. Math. Soc., 2019

2016
The number of B<sub>3</sub>-sets of a given cardinality.
[BibTeX]
[DOI]
Domingos Dellamonica Jr.
,
Yoshiharu Kohayakawa
,
Sangjune Lee
,
Vojtech Rödl
,
Wojciech Samotij
J. Comb. Theory A, 2016

On the Number of <i>B<sub>h</sub> </i>-Sets.
[BibTeX]
[DOI]
Domingos Dellamonica Jr.
,
Yoshiharu Kohayakawa
,
Sangjune Lee
,
Vojtech Rödl
,
Wojciech Samotij
Comb. Probab. Comput., 2016

2015
Smoothed Analysis on Connected Graphs.
[BibTeX]
[DOI]
Michael Krivelevich
,
Daniel Reichman
,
Wojciech Samotij
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.
[BibTeX]
[DOI]
Yoshiharu Kohayakawa
,
Sangjune Lee
,
Vojtech Rödl
,
Wojciech Samotij
Random Struct. Algorithms, 2015

On the number of monotone sequences.
[BibTeX]
[DOI]
Wojciech Samotij
,
Benny Sudakov
J. Comb. Theory B, 2015

Counting independent sets in graphs.
[BibTeX]
[DOI]
Wojciech Samotij
Eur. J. Comb., 2015

2014
Stability results for random discrete structures.
[BibTeX]
[DOI]
Wojciech Samotij
Random Struct. Algorithms, 2014

Long Paths and Cycles in Random Subgraphs of $\mathcal{H}$-free Graphs.
[BibTeX]
[DOI]
Michael Krivelevich
,
Wojciech Samotij
Electron. J. Comb., 2014

2013
Lipschitz Functions on Expanders are Typically Flat.
[BibTeX]
[DOI]
Ron Peled
,
Wojciech Samotij
,
Amir Yehudayoff
Comb. Probab. Comput., 2013

Expanders Are Universal for the Class of All Spanning Trees.
[BibTeX]
[DOI]
Daniel Johannsen
,
Michael Krivelevich
,
Wojciech Samotij
Comb. Probab. Comput., 2013

2012
Optimal Packings of Hamilton Cycles in Sparse Random Graphs.
[BibTeX]
[DOI]
Michael Krivelevich
,
Wojciech Samotij
SIAM J. Discret. Math., 2012

Pancyclic subgraphs of random graphs.
[BibTeX]
[DOI]
Choongbum Lee
,
Wojciech Samotij
J. Graph Theory, 2012

Corrádi and Hajnal's Theorem for Sparse Random Graphs.
[BibTeX]
[DOI]
József Balogh
,
Choongbum Lee
,
Wojciech Samotij
Comb. Probab. Comput., 2012

2011
Local resilience of almost spanning trees in random graphs.
[BibTeX]
[DOI]
József Balogh
,
Béla Csaba
,
Wojciech Samotij
Random Struct. Algorithms, 2011

The number of <i>K</i><sub><i>s, t</i></sub>-free graphs.
[BibTeX]
[DOI]
József Balogh
,
Wojciech Samotij
J. Lond. Math. Soc., 2011

On the Chvátal-Erdös Triangle Game.
[BibTeX]
[DOI]
József Balogh
,
Wojciech Samotij
Electron. J. Comb., 2011

The number of <i>K</i><sub><i>m, m</i></sub>-free graphs.
[BibTeX]
[DOI]
József Balogh
,
Wojciech Samotij
Comb., 2011

2010
Almost All C<sub>4</sub>-Free Graphs Have Fewer than (1-epsilon), ex(n, C<sub>4</sub>) Edges.
[BibTeX]
[DOI]
József Balogh
,
Wojciech Samotij
SIAM J. Discret. Math., 2010

Large Bounded Degree Trees in Expanding Graphs.
[BibTeX]
[DOI]
József Balogh
,
Béla Csaba
,
Martin Pei
,
Wojciech Samotij
Electron. J. Comb., 2010

2009
Sizes of Induced Subgraphs of Ramsey Graphs.
[BibTeX]
[DOI]
Noga Alon
,
József Balogh
,
Alexandr V. Kostochka
,
Wojciech Samotij
Comb. Probab. Comput., 2009


  Loading...