We stand with Ukraine  

Joshua Erde

Orcid: 0000-0003-1129-4270

According to our database1, Joshua Erde authored at least 25 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Percolation on irregular high-dimensional product graphs.
[BibTeX]
[DOI]
Sahar Diskin
,
Joshua Erde
,
Mihyun Kang
,
Michael Krivelevich
Comb. Probab. Comput., 2024

2023
Ubiquity of graphs with nowhere-linear end structure.
[BibTeX]
[DOI]
Nathan J. Bowler
,
Christian Elbracht
,
Joshua Erde
,
J. Pascal Gollin
,
Karl Heuer
,
Max Pitz
,
Maximilian Teegen
J. Graph Theory, July, 2023

Component Behaviour and Excess of Random Bipartite Graphs Near the Critical Point.
[BibTeX]
[DOI]
Tuan A. Do
,
Joshua Erde
,
Mihyun Kang
,
Michael Missethan
Electron. J. Comb., 2023

2022
Planarity and Genus of Sparse Random Bipartite Graphs.
[BibTeX]
[DOI]
Tuan A. Do
,
Joshua Erde
,
Mihyun Kang
SIAM J. Discret. Math., 2022

Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups.
[BibTeX]
[DOI]
Joshua Erde
,
Florian Lehner
J. Graph Theory, 2022

Topological ubiquity of trees.
[BibTeX]
[DOI]
Nathan J. Bowler
,
Christian Elbracht
,
Joshua Erde
,
J. Pascal Gollin
,
Karl Heuer
,
Max Pitz
,
Maximilian Teegen
J. Comb. Theory, Ser. B, 2022

2021
Bounding the Cop Number of a Graph by Its Genus.
[BibTeX]
[DOI]
Nathan J. Bowler
,
Joshua Erde
,
Florian Lehner
,
Max Pitz
SIAM J. Discret. Math., 2021

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs.
[BibTeX]
[DOI]
Joshua Erde
,
J. Pascal Gollin
,
Attila Joó
,
Paul Knappe
,
Max Pitz
J. Comb. Theory, Ser. B, 2021

Enlarging vertex-flames in countable digraphs.
[BibTeX]
[DOI]
Joshua Erde
,
J. Pascal Gollin
,
Attila Joó
J. Comb. Theory, Ser. B, 2021

Large complete minors in random subgraphs.
[BibTeX]
[DOI]
Joshua Erde
,
Mihyun Kang
,
Michael Krivelevich
Comb. Probab. Comput., 2021

Base Partition for Mixed Families of Finitary and Cofinitary Matroids.
[BibTeX]
[DOI]
Joshua Erde
,
J. Pascal Gollin
,
Attila Joó
,
Paul Knappe
,
Max Pitz
Comb., 2021

2020
Directed Path-Decompositions.
[BibTeX]
[DOI]
Joshua Erde
SIAM J. Discret. Math., 2020

Hamilton decompositions of one-ended Cayley graphs.
[BibTeX]
[DOI]
Joshua Erde
,
Florian Lehner
,
Max Pitz
J. Comb. Theory, Ser. B, 2020

2019
A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors.
[BibTeX]
[DOI]
Joshua Erde
,
Daniel Weißauer
SIAM J. Discret. Math., 2019

Structural submodularity and tangles in abstract separation systems.
[BibTeX]
[DOI]
Reinhard Diestel
,
Joshua Erde
,
Daniel Weißauer
J. Comb. Theory, Ser. A, 2019

2018
A unified treatment of linked and lean tree-decompositions.
[BibTeX]
[DOI]
Joshua Erde
J. Comb. Theory, Ser. B, 2018

Non-reconstructible locally finite graphs.
[BibTeX]
[DOI]
Nathan J. Bowler
,
Joshua Erde
,
Peter Heinig
,
Florian Lehner
,
Max Pitz
J. Comb. Theory, Ser. B, 2018

2017
Refining a Tree-Decomposition which Distinguishes Tangles.
[BibTeX]
[DOI]
Joshua Erde
SIAM J. Discret. Math., 2017

Duality Theorems for Blocks and Tangles in Graphs.
[BibTeX]
[DOI]
Reinhard Diestel
,
Philipp Eberenz
,
Joshua Erde
SIAM J. Discret. Math., 2017

A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs.
[BibTeX]
[DOI]
Nathan J. Bowler
,
Joshua Erde
,
Florian Lehner
,
Martin Merker
,
Max Pitz
,
Konstantinos S. Stavropoulos
Discret. Appl. Math., 2017

2016
An $n$-in-a-row Type Game.
[BibTeX]
[DOI]
Joshua Erde
,
Mark Walters
Electron. J. Comb., 2016

2015
An n-in-a-row Game.
[BibTeX]
[DOI]
Joshua Erde
Integers, 2015

2014
Decomposing the cube into paths.
[BibTeX]
[DOI]
Joshua Erde
Discret. Math., 2014

2012
Knight's Tours in Higher Dimensions
[BibTeX]
[DOI]
Joshua Erde
CoRR, 2012

The Closed Knight Tour Problem in Higher Dimensions.
[BibTeX]
[DOI]
Joshua Erde
,
Bruno Golénia
,
Sylvain Golénia
Electron. J. Comb., 2012


  Loading...