default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNatasha Morrison
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Natalie C. Behague, Akina Kuperus, Natasha Morrison, Ashna Wright:
Improved Bounds for Cross-Sperner Systems. Electron. J. Comb. 31(2) (2024)- [j17]Shoham Letzter
, Natasha Morrison:
Directed cycles with zero weight in Zpk. J. Comb. Theory B 168: 192-207 (2024) - [j16]Natalie C. Behague, Tom Johnston, Shoham Letzter, Natasha Morrison, Shannon Ogden:
The Rainbow Saturation Number Is Linear. SIAM J. Discret. Math. 38(2): 1239-1249 (2024) - [j15]József Balogh, Anita Liebenau, Letícia Mattos, Natasha Morrison:
On Multicolor Turán Numbers. SIAM J. Discret. Math. 38(3): 2297-2311 (2024) - [j14]Natalie C. Behague, Natasha Morrison, Jonathan A. Noel:
Off-Diagonal Commonality of Graphs via Entropy. SIAM J. Discret. Math. 38(3): 2335-2360 (2024) - 2023
- [j13]Natasha Morrison, JD Nir, Sergey Norin, Pawel Rzazewski, Alexandra Wesolek:
Every graph is eventually Turán-good. J. Comb. Theory B 162: 231-243 (2023) - 2022
- [i4]Natalie C. Behague, Natasha Morrison, Jonathan A. Noel:
Common Pairs of Graphs. CoRR abs/2208.02045 (2022) - 2021
- [j12]Zdenek Dvorák, Natasha Morrison, Jonathan A. Noel, Sergey Norin, Luke Postle:
Bounding the number of cycles in a graph in terms of its degree sequence. Eur. J. Comb. 91: 103206 (2021) - [j11]Gal Kronenberg, Taísa Martins, Natasha Morrison:
Weak saturation numbers of complete bipartite graphs in the clique. J. Comb. Theory A 178: 105357 (2021) - [j10]Natasha Morrison, Alexander Roberts, Alex D. Scott:
Maximising the number of cycles in graphs with forbidden subgraphs. J. Comb. Theory B 147: 201-237 (2021) - 2020
- [j9]Marthe Bonamy, Natasha Morrison, Alex Scott:
Partitioning the vertices of a torus into isomorphic subgraphs. J. Comb. Theory A 174: 105252 (2020) - [j8]Nina Kamcev, Michael Krivelevich, Natasha Morrison, Benny Sudakov:
The Kőnig graph process. Random Struct. Algorithms 57(4): 1272-1302 (2020)
2010 – 2019
- 2019
- [j7]Dennis Clemens, Matthew Jenssen, Yoshiharu Kohayakawa, Natasha Morrison, Guilherme Oliveira Mota, Damian Reding, Barnaby Roberts:
The size?Ramsey number of powers of paths. J. Graph Theory 91(3): 290-299 (2019) - 2018
- [j6]Natasha Morrison, Jonathan A. Noel:
Extremal bounds for bootstrap percolation in the hypercube. J. Comb. Theory A 156: 61-84 (2018) - 2017
- [j5]Natasha Morrison, Jonathan A. Noel, Alex Scott:
Saturation in the Hypercube and Bootstrap Percolation. Comb. Probab. Comput. 26(1): 78-98 (2017) - [j4]Natasha Morrison, Jonathan A. Noel:
Extremal Bounds for Bootstrap Percolation in the Hypercube. Electron. Notes Discret. Math. 61: 877-883 (2017) - [j3]Natasha Morrison, Alex Scott:
Maximising the number of induced cycles in a graph. J. Comb. Theory B 126: 24-61 (2017) - 2016
- [j2]Karen Gunderson, Natasha Morrison, Jason Semeraro:
Bounding the number of hyperedges in friendship r-hypergraphs. Eur. J. Comb. 51: 125-134 (2016) - 2014
- [j1]Natasha Morrison, Jonathan A. Noel, Alex Scott:
On Saturated k-Sperner Systems. Electron. J. Comb. 21(3): 3 (2014) - [i3]Natasha Morrison, Jonathan A. Noel, Alex D. Scott:
On Saturated k-Sperner Systems. CoRR abs/1402.5646 (2014) - [i2]Natasha Morrison, Jonathan A. Noel, Alex Scott:
Saturation in the Hypercube and Bootstrap Percolation. CoRR abs/1408.5488 (2014) - [i1]Karen Gunderson, Natasha Morrison, Jason Semeraro:
Bounding the Number of Hyperedges in Friendship $r$-Hypergraphs. CoRR abs/1412.5822 (2014)
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-10-07 22:19 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:
