The following pages link to Joshua Erde (Q311488):
Displaying 44 items.
- An \(n\)-in-a-row type game (Q311490) (← links)
- A note on the combinatorial derivation of nonsmall sets (Q462710) (← links)
- Decomposing the cube into paths (Q740656) (← links)
- A unified treatment of linked and lean tree-decompositions (Q1745735) (← links)
- Non-reconstructible locally finite graphs (Q1791706) (← links)
- The closed knight tour problem in higher dimensions (Q1953312) (← links)
- Enlarging vertex-flames in countable digraphs (Q1984520) (← links)
- A counterexample to montgomery's conjecture on dynamic colourings of regular graphs (Q2012068) (← links)
- A Cantor-Bernstein-type theorem for spanning trees in infinite graphs (Q2033907) (← links)
- Base partition for mixed families of finitary and cofinitary matroids (Q2036617) (← links)
- Expansion in supercritical random subgraphs of the hypercube and its consequences (Q2105142) (← links)
- Topological ubiquity of trees (Q2171012) (← links)
- Hamilton decompositions of one-ended Cayley graphs (Q2284729) (← links)
- Structural submodularity and tangles in abstract separation systems (Q2318482) (← links)
- An n-in-a-row Game (Q3196532) (← links)
- Isoperimetry in integer lattices (Q4645032) (← links)
- Planarity and Genus of Sparse Random Bipartite Graphs (Q5084098) (← links)
- Bounding the Cop Number of a Graph by Its Genus (Q5163511) (← links)
- A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors (Q5194622) (← links)
- Directed Path-Decompositions (Q5215903) (← links)
- Duality Theorems for Blocks and Tangles in Graphs (Q5275442) (← links)
- Refining a Tree-Decomposition which Distinguishes Tangles (Q5275443) (← links)
- A counterexample to the reconstruction conjecture for locally finite trees (Q5357097) (← links)
- Large complete minors in random subgraphs (Q5886102) (← links)
- Hamiltonian decompositions of 4‐regular Cayley graphs of infinite abelian groups (Q6057642) (← links)
- Isoperimetric stability in lattices (Q6073680) (← links)
- Ubiquity of graphs with nowhere‐linear end structure (Q6074597) (← links)
- Duality and tangles of set separations (Q6087336) (← links)
- A note on the width of sparse random graphs (Q6494006) (← links)
- Percolation on High-dimensional Product Graphs (Q6506548) (← links)
- Percolation on Irregular High-dimensional Product Graphs (Q6507092) (← links)
- Isoperimetric Inequalities and Supercritical Percolation on High-dimensional Graphs (Q6509448) (← links)
- Catching a robber on a random $k$-uniform hypergraph (Q6512204) (← links)
- Percolation through Isoperimetry (Q6512551) (← links)
- Matchings in the hypercube with specified edges (Q6529332) (← links)
- The evolution of the permutahedron (Q6532190) (← links)
- Improved bounds on the cop number of a graph drawn on a surface (Q6604681) (← links)
- Isoperimetric inequalities and supercritical percolation on high-dimensional graphs (Q6607836) (← links)
- Ubiquity of locally finite graphs with extensive tree-decompositions (Q6615520) (← links)
- Bounding the cop number of a graph by its genus (Q6621170) (← links)
- Percolation on irregular high-dimensional product graphs (Q6632810) (← links)
- Universal behaviour of majority bootstrap percolation on high-dimensional geometric graphs (Q6733981) (← links)
- Long cycles in percolated expanders (Q6736706) (← links)
- Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs (Q6737634) (← links)
