default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoshua Erde
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j27]Sahar Diskin
, Joshua Erde, Mihyun Kang, Michael Krivelevich:
Percolation on High-Dimensional Product Graphs. Random Struct. Algorithms 66(1) (2025)- 2024
- [j26]Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich:
Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs. Comb. 44(4): 741-784 (2024) - [j25]Nathan J. Bowler, Christian Elbracht, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen:
Ubiquity of locally finite graphs with extensive tree-decompositions. Comb. Theory 4(2) (2024) - [j24]Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich:
Percolation on irregular high-dimensional product graphs. Comb. Probab. Comput. 33(3): 377-403 (2024) - 2023
- [j23]Tuan A. Do, Joshua Erde, Mihyun Kang, Michael Missethan:
Component Behaviour and Excess of Random Bipartite Graphs Near the Critical Point. Electron. J. Comb. 30(3) (2023) - [j22]Nathan J. Bowler, Christian Elbracht, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen:
Ubiquity of graphs with nowhere-linear end structure. J. Graph Theory 103(3): 564-598 (2023) - 2022
- [j21]Nathan J. Bowler, Christian Elbracht, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen:
Topological ubiquity of trees. J. Comb. Theory B 157: 70-95 (2022) - [j20]Joshua Erde, Florian Lehner:
Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups. J. Graph Theory 101(3): 559-571 (2022) - [j19]Tuan A. Do, Joshua Erde, Mihyun Kang:
Planarity and Genus of Sparse Random Bipartite Graphs. SIAM J. Discret. Math. 36(2): 1394-1415 (2022) - 2021
- [j18]Joshua Erde, J. Pascal Gollin, Attila Joó, Paul Knappe, Max Pitz:
Base Partition for Mixed Families of Finitary and Cofinitary Matroids. Comb. 41(1): 31-52 (2021) - [j17]Joshua Erde, Mihyun Kang, Michael Krivelevich:
Large complete minors in random subgraphs. Comb. Probab. Comput. 30(4): 619-630 (2021) - [j16]Joshua Erde, J. Pascal Gollin, Attila Joó, Paul Knappe, Max Pitz:
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs. J. Comb. Theory B 149: 16-22 (2021) - [j15]Joshua Erde, J. Pascal Gollin, Attila Joó:
Enlarging vertex-flames in countable digraphs. J. Comb. Theory B 151: 263-281 (2021) - [j14]Nathan J. Bowler, Joshua Erde, Florian Lehner, Max Pitz:
Bounding the Cop Number of a Graph by Its Genus. SIAM J. Discret. Math. 35(4): 2459-2489 (2021) - 2020
- [j13]Joshua Erde, Florian Lehner, Max Pitz:
Hamilton decompositions of one-ended Cayley graphs. J. Comb. Theory, Ser. B 140: 171-191 (2020) - [j12]Joshua Erde:
Directed Path-Decompositions. SIAM J. Discret. Math. 34(1): 415-430 (2020)
2010 – 2019
- 2019
- [j11]Reinhard Diestel, Joshua Erde, Daniel Weißauer:
Structural submodularity and tangles in abstract separation systems. J. Comb. Theory A 167: 155-180 (2019) - [j10]Joshua Erde, Daniel Weißauer:
A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors. SIAM J. Discret. Math. 33(3): 1654-1661 (2019) - 2018
- [j9]Joshua Erde:
A unified treatment of linked and lean tree-decompositions. J. Comb. Theory B 130: 114-143 (2018) - [j8]Nathan J. Bowler, Joshua Erde, Peter Heinig, Florian Lehner, Max Pitz:
Non-reconstructible locally finite graphs. J. Comb. Theory B 133: 122-152 (2018) - 2017
- [j7]Nathan J. Bowler, Joshua Erde, Florian Lehner, Martin Merker, Max Pitz, Konstantinos S. Stavropoulos:
A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs. Discret. Appl. Math. 229: 151-153 (2017) - [j6]Reinhard Diestel, Philipp Eberenz, Joshua Erde:
Duality Theorems for Blocks and Tangles in Graphs. SIAM J. Discret. Math. 31(3): 1514-1528 (2017) - [j5]Joshua Erde:
Refining a Tree-Decomposition which Distinguishes Tangles. SIAM J. Discret. Math. 31(3): 1529-1551 (2017) - 2016
- [j4]Joshua Erde, Mark Walters:
An $n$-in-a-row Type Game. Electron. J. Comb. 23(3): 3 (2016) - 2015
- [j3]Joshua Erde:
An n-in-a-row Game. Integers 15: G5 (2015) - 2014
- [j2]Joshua Erde:
Decomposing the cube into paths. Discret. Math. 336: 41-45 (2014) - 2012
- [j1]Joshua Erde, Bruno Golénia, Sylvain Golénia:
The Closed Knight Tour Problem in Higher Dimensions. Electron. J. Comb. 19(4): 9 (2012) - [i2]Joshua Erde:
Knight's Tours in Higher Dimensions. CoRR abs/1202.5548 (2012) - [i1]Joshua Erde:
An n-in-a-row Game. CoRR abs/1209.5123 (2012)
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 2025-01-20 23:00 CET 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:
