default search action
Julia Böttcher
Person information
- affiliation: London School of Economics, Department of Mathematics, London, UK
- affiliation: University of São Paulo, Department of Computer Science, São Paulo, SP, Brazil
- affiliation (PhD 2009): Technical University of Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j42]Peter Allen, Julia Böttcher, Richard Lang, Jozef Skokan
, Maya Stein:
Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles. Eur. J. Comb. 121: 103838 (2024) - 2023
- [j41]Julia Böttcher
Triangles in randomly perturbed graphs. Comb. Probab. Comput. 32(1): 91-121 (2023) - 2022
- [j40]Peter Allen, Julia Böttcher
A spanning bandwidth theorem in random graphs. Comb. Probab. Comput. 31(4): 598-628 (2022) - [j39]Jon Leefmann
Editorial: Public research and private knowledge - Science in times of diverse research funding. Frontiers Res. Metrics Anal. 7 (2022) - 2021
- [c7]Peter Allen, Julia Böttcher
An Approximate Blow-up Lemma for Sparse Hypergraphs. LAGOS 2021: 394-403 - [c6]Julia Böttcher
Cycle factors in randomly perturbed graphs. LAGOS 2021: 404-411 - 2020
- [j38]Peter Allen, Julia Böttcher
Regularity inheritance in pseudorandom graphs. Random Struct. Algorithms 56(2): 306-338 (2020)
2010 – 2019
- 2019
- [j37]Julia Böttcher
Universality for bounded degree spanning trees in randomly perturbed graphs. Random Struct. Algorithms 55(4): 854-864 (2019) - 2018
- [j36]Peter Allen, Julia Böttcher
Triangle-Free Subgraphs of Random Graphs. Comb. Probab. Comput. 27(2): 141-161 (2018) - 2017
- [j35]Peter Allen, Julia Böttcher
Powers of Hamilton cycles in pseudorandom graphs. Comb. 37(4): 573-616 (2017) - [j34]Peter Allen, Julia Böttcher
Packing degenerate graphs greedily. Electron. Notes Discret. Math. 61: 45-51 (2017) - [j33]Julia Böttcher
Embedding spanning bounded degree subgraphs in randomly perturbed graphs. Electron. Notes Discret. Math. 61: 155-161 (2017) - [j32]Peter Allen, Julia Böttcher
Tight cycles and regular slices in dense hypergraphs. J. Comb. Theory A 149: 30-100 (2017) - [j31]Peter Allen, Julia Böttcher
Chromatic thresholds in dense random graphs. Random Struct. Algorithms 51(2): 185-214 (2017) - [j30]Peter Allen, Julia Böttcher
Chromatic thresholds in sparse random graphs. Random Struct. Algorithms 51(2): 215-236 (2017) - [c5]Julia Böttcher:
Large-scale structures in random graphs. BCC 2017: 87-140 - 2016
- [j29]Julia Böttcher
Spanning embeddings of arrangeable graphs with sublinear bandwidth. Random Struct. Algorithms 48(2): 270-289 (2016) - 2015
- [j28]Peter Allen, Julia Böttcher
Triangle-Free Subgraphs of Random Graphs. Electron. Notes Discret. Math. 49: 393-397 (2015) - [j27]Peter Allen, Julia Böttcher
Local resilience of spanning subgraphs in sparse random graphs. Electron. Notes Discret. Math. 49: 513-521 (2015) - [j26]Peter Allen, Julia Böttcher
Tight Cycles in Hypergraphs. Electron. Notes Discret. Math. 49: 675-682 (2015) - [j25]Peter Allen, Julia Böttcher
Regular slices for hypergraphs. Electron. Notes Discret. Math. 49: 691-698 (2015) - [j24]Peter Allen, Julia Böttcher
Tight Hamilton cycles in random hypergraphs. Random Struct. Algorithms 46(3): 446-465 (2015) - [j23]Julia Böttcher
An Extension of the Blow-up Lemma to Arrangeable Graphs. SIAM J. Discret. Math. 29(2): 962-1001 (2015) - 2014
- [j22]Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet:
An Extension of Turán's Theorem, Uniqueness and Stability. Electron. J. Comb. 21(4): 4 (2014) - [j21]Peter Allen, Julia Böttcher
An improved error term for minimum H-decompositions of graphs. J. Comb. Theory B 108: 92-101 (2014) - [c4]Julia Böttcher
An Approximate Version of the Tree Packing Conjecture via Random Embeddings. APPROX-RANDOM 2014: 490-499 - [c3]Peter Allen, Julia Böttcher
Powers of Hamilton Cycles in Pseudorandom Graphs. LATIN 2014: 355-366 - 2013
- [j20]Julia Böttcher, Jan Foniok:
Ramsey Properties of Permutations. Electron. J. Comb. 20(1): 2 (2013) - [j19]Julia Böttcher
Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal. Comb. Probab. Comput. 22(5): 639-683 (2013) - [j18]Peter Allen, Julia Böttcher
An approximate blow-up lemma for sparse pseudorandom graphs. Electron. Notes Discret. Math. 44: 393-398 (2013) - [j17]Peter Allen, Julia Böttcher
Turánnical hypergraphs. Random Struct. Algorithms 42(1): 29-58 (2013) - 2012
- [j16]Julia Böttcher
Perfect Graphs of Fixed Density: Counting and Homogeneous Sets. Comb. Probab. Comput. 21(5): 661-682 (2012) - [j15]Julia Böttcher
The tripartite Ramsey number for trees. J. Graph Theory 69(3): 264-300 (2012) - [j14]Julia Böttcher
Properly coloured copies and rainbow copies of large graphs with small maximum degree. Random Struct. Algorithms 40(4): 425-436 (2012) - 2011
- [j13]Peter Allen, Julia Böttcher
A density Corrádi-Hajnal theorem. Electron. Notes Discret. Math. 38: 31-36 (2011) - [j12]Julia Böttcher
Induced C5-free graphs of fixed density: counting and homogeneous sets. Electron. Notes Discret. Math. 38: 181-186 (2011) - [j11]Peter Allen, Julia Böttcher
Filling the gap between Turán's theorem and Pósa's conjecture. J. Lond. Math. Soc. 84(2): 269-302 (2011) - 2010
- [j10]Julia Böttcher
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. Eur. J. Comb. 31(5): 1217-1227 (2010) - [j9]Julia Böttcher
Embedding into Bipartite Graphs. SIAM J. Discret. Math. 24(4): 1215-1233 (2010)
2000 – 2009
- 2009
- [j8]Peter Allen, Julia Böttcher
Minimum degree conditions for large subgraphs. Electron. Notes Discret. Math. 34: 75-79 (2009) - [j7]Julia Böttcher
Forcing spanning subgraphs via Ore type conditions. Electron. Notes Discret. Math. 34: 255-259 (2009) - [j6]Julia Böttcher
The tripartite Ramsey number for trees. Electron. Notes Discret. Math. 34: 597-601 (2009) - [j5]Julia Böttcher
Almost spanning subgraphs of random graphs after adversarial edge removal. Electron. Notes Discret. Math. 35: 335-340 (2009) - 2008
- [j4]Julia Böttcher
Bandwidth, treewidth, separators, expansion, and universality. Electron. Notes Discret. Math. 31: 91-96 (2008) - [j3]Julia Böttcher
On the tractability of coloring semirandom graphs. Inf. Process. Lett. 108(3): 143-149 (2008) - [j2]Julia Böttcher
Spanning 3-colourable subgraphs of small bandwidth in dense graphs. J. Comb. Theory B 98(4): 752-777 (2008) - 2007
- [j1]Julia Böttcher
Embedding spanning subgraphs of small bandwidth. Electron. Notes Discret. Math. 29: 485-489 (2007) - [c2]Julia Böttcher, Mathias Schacht, Anusch Taraz:
On the bandwidth conjecture for 3-colourable graphs. SODA 2007: 618-626 - 2005
- [c1]Julia Böttcher:
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time. MFCS 2005: 156-167
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-09-09 01:18 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: