Pages that link to "Item:Q2380438"
From MaRDI portal
The following pages link to Large bounded degree trees in expanding graphs (Q2380438):
Displaying 24 items.
- The vertex size-Ramsey number (Q267205) (← links)
- Global maker-breaker games on sparse graphs (Q616371) (← links)
- Embedding nearly-spanning bounded degree trees (Q950331) (← links)
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs (Q976141) (← links)
- An algorithmic Friedman-Pippenger theorem on tree embeddings and applications (Q1010862) (← links)
- Expanding graphs contain all small trees (Q1092058) (← links)
- Sparse multipartite graphs as partition universal for graphs with bounded degree (Q1743481) (← links)
- Random perturbation of sparse graphs (Q2030748) (← links)
- Cycle lengths in expanding graphs (Q2036619) (← links)
- Spanning trees in random graphs (Q2326663) (← links)
- Universality of random graphs and rainbow embedding (Q2811163) (← links)
- Cycle Factors and Renewal Theory (Q2958190) (← links)
- Local resilience of almost spanning trees in random graphs (Q3068763) (← links)
- Sharp threshold for the appearance of certain spanning trees in random graphs (Q3145834) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Limitations on Explicit Constructions of Expanding Graphs (Q3323289) (← links)
- An improved upper bound on the density of universal random graphs (Q4982616) (← links)
- (Q5009641) (← links)
- Rolling backwards can move you forward: On embedding problems in sparse expanders (Q5082387) (← links)
- Universality for bounded degree spanning trees in randomly perturbed graphs (Q5216180) (← links)
- Optimal threshold for a random graph to be 2-universal (Q5234488) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition (Q5267992) (← links)
- (Q5743497) (← links)
- Rainbow trees in uniformly edge‐colored graphs (Q6074865) (← links)
