Pages that link to "Item:Q3691689"
From MaRDI portal
The following pages link to Packing a tree with a graph of the same size (Q3691689):
Displaying 20 items.
- On Erdős-Sós conjecture for trees of large size (Q276193) (← links)
- On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices (Q389980) (← links)
- The Erdős-Sós conjecture for spiders of large size (Q393909) (← links)
- A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277) (← links)
- Packing two graphs of order n having total size at most 2n-2 (Q803166) (← links)
- Two theorems on packings of graphs (Q1090341) (← links)
- Packing trees in complete graphs (Q1101132) (← links)
- Symmetric edge-decompositions of hypercubes (Q1175554) (← links)
- On packing bipartite graphs (Q1200276) (← links)
- Packing graphs in their complements (Q1584285) (← links)
- Packing of graphs - a survey (Q1825885) (← links)
- Packing a tree of order \(p\) with a \((p,p+1)\)-graph (Q1873645) (← links)
- The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\) (Q1884650) (← links)
- Packing two copies of a tree into its fourth power (Q1970711) (← links)
- On the Erdős-Sós conjecture for graphs with circumference at most \(k+1\) (Q2089550) (← links)
- Packing three copies of a tree into its sixth power (Q2243090) (← links)
- Packing two copies of a sparse graph into a graph with restrained maximum degree (Q3652549) (← links)
- (Q3699703) (← links)
- My Top 10 Graph Theory Conjectures and Open Problems (Q5506779) (← links)
- A Spectral Erdős-Sós Theorem (Q6072289) (← links)
