The following pages link to Spanning Trees in Dense Graphs (Q2777891):
Displaying 21 items.
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs (Q933679) (← links)
- On embedding well-separable graphs (Q941369) (← links)
- Proof of the bandwidth conjecture of Bollobás and Komlós (Q957895) (← links)
- Random perturbation of sparse graphs (Q2030748) (← links)
- Spanning trees of dense directed graphs (Q2132400) (← links)
- On the bipartite graph packing problem (Q2357142) (← links)
- Spanning trees in dense directed graphs (Q2673485) (← links)
- Spanning embeddings of arrangeable graphs with sublinear bandwidth (Q2795744) (← links)
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs (Q2957690) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A blow-up lemma for approximate decompositions (Q4633567) (← links)
- Tree decompositions of graphs without large bipartite holes (Q5120745) (← links)
- Universality for bounded degree spanning trees in randomly perturbed graphs (Q5216180) (← links)
- Degree Conditions for Embedding Trees (Q5232383) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition (Q5267992) (← links)
- Bandwidth, treewidth, separators, expansion, and universality (Q5300988) (← links)
- (Q5743497) (← links)
- Transversal factors and spanning trees (Q5871277) (← links)
- Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result (Q6094046) (← links)
- Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result (Q6094048) (← links)
- Dirac-type conditions for spanning bounded-degree hypertrees (Q6187344) (← links)
