default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWojciech Samotij
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j24]Noga Alon, Michael Krivelevich
, Wojciech Samotij:
Largest subgraph from a hereditary property in a random graph. Discret. Math. 346(9): 113480 (2023)- 2020
- [j23]Frank Mousset, Rajko Nenadov, Wojciech Samotij:
Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties. Comb. Probab. Comput. 29(6): 943-955 (2020) - [j22]Wojciech Samotij, Clara Shikhelman:
A generalized Turán problem in random graphs. Random Struct. Algorithms 56(2): 283-305 (2020)
2010 – 2019
- 2019
- [j21]Asaf Ferber, Wojciech Samotij:
Packing trees of unbounded degrees in random graphs. J. Lond. Math. Soc. 99(3): 653-677 (2019) - 2016
- [j20]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij:
On the Number of Bh -Sets. Comb. Probab. Comput. 25(1): 108-129 (2016) - [j19]Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij:
The number of B3-sets of a given cardinality. J. Comb. Theory A 142: 44-76 (2016) - 2015
- [j18]Wojciech Samotij:
Counting independent sets in graphs. Eur. J. Comb. 48: 5-18 (2015) - [j17]Wojciech Samotij, Benny Sudakov:
On the number of monotone sequences. J. Comb. Theory B 115: 132-163 (2015) - [j16]Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij:
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers. Random Struct. Algorithms 46(1): 1-25 (2015) - [j15]Michael Krivelevich, Daniel Reichman, Wojciech Samotij:
Smoothed Analysis on Connected Graphs. SIAM J. Discret. Math. 29(3): 1654-1669 (2015) - 2014
- [j14]Michael Krivelevich, Wojciech Samotij:
Long Paths and Cycles in Random Subgraphs of $\mathcal{H}$-free Graphs. Electron. J. Comb. 21(1): 1 (2014) - [j13]Wojciech Samotij:
Stability results for random discrete structures. Random Struct. Algorithms 44(3): 269-289 (2014) - [c2]Michael Krivelevich, Daniel Reichman, Wojciech Samotij:
Smoothed Analysis on Connected Graphs. APPROX-RANDOM 2014: 810-825 - 2013
- [j12]Daniel Johannsen, Michael Krivelevich, Wojciech Samotij:
Expanders Are Universal for the Class of All Spanning Trees. Comb. Probab. Comput. 22(2): 253-281 (2013) - [j11]Ron Peled, Wojciech Samotij, Amir Yehudayoff:
Lipschitz Functions on Expanders are Typically Flat. Comb. Probab. Comput. 22(4): 566-591 (2013) - 2012
- [j10]József Balogh, Choongbum Lee, Wojciech Samotij:
Corrádi and Hajnal's Theorem for Sparse Random Graphs. Comb. Probab. Comput. 21(1-2): 23-55 (2012) - [j9]Choongbum Lee, Wojciech Samotij:
Pancyclic subgraphs of random graphs. J. Graph Theory 71(2): 142-158 (2012) - [j8]Michael Krivelevich, Wojciech Samotij:
Optimal Packings of Hamilton Cycles in Sparse Random Graphs. SIAM J. Discret. Math. 26(3): 964-982 (2012) - [c1]Daniel Johannsen, Michael Krivelevich, Wojciech Samotij:
Expanders are universal for the class of all spanning trees. SODA 2012: 1539-1551 - 2011
- [j7]József Balogh, Wojciech Samotij:
The number of Km, m-free graphs. Comb. 31(2): 131-150 (2011) - [j6]József Balogh, Wojciech Samotij:
On the Chvátal-Erdös Triangle Game. Electron. J. Comb. 18(1) (2011) - [j5]József Balogh, Wojciech Samotij:
The number of Ks, t-free graphs. J. Lond. Math. Soc. 83(2): 368-388 (2011) - [j4]József Balogh, Béla Csaba, Wojciech Samotij:
Local resilience of almost spanning trees in random graphs. Random Struct. Algorithms 38(1-2): 121-139 (2011) - 2010
- [j3]József Balogh, Béla Csaba, Martin Pei, Wojciech Samotij:
Large Bounded Degree Trees in Expanding Graphs. Electron. J. Comb. 17(1) (2010) - [j2]József Balogh, Wojciech Samotij:
Almost All C4-Free Graphs Have Fewer than (1-epsilon), ex(n, C4) Edges. SIAM J. Discret. Math. 24(3): 1011-1018 (2010)
2000 – 2009
- 2009
- [j1]Noga Alon, József Balogh, Alexandr V. Kostochka, Wojciech Samotij:
Sizes of Induced Subgraphs of Ramsey Graphs. Comb. Probab. Comput. 18(4): 459-476 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
