Pages that link to "Item:Q5434262"
From MaRDI portal
The following pages link to Constructing trees in graphs with no <i>K</i><sub>2,<i>s</i></sub> (Q5434262):
Displaying 10 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)
- Subtrees and subforests of graphs (Q1328385) (← links)
- A variation of the Erdős-Sós conjecture in bipartite graphs (Q2014230) (← links)
- Graphs with at most two trees in a forest-building process (Q2424270) (← links)
- Turán Numbers of Multiple Paths and Equibipartite Forests (Q3103631) (← links)
- Constructing Trees in Graphs whose Complement has no <b><i>K</i></b><sub>2,<b><i>s</i></b></sub> (Q3146982) (← links)
- A new construction of a Kurepa tree with no Aronszajn subtree (Q3320355) (← links)
- Embedding trees in graphs with independence number two (Q4577857) (← links)
- A Local Approach to the Erdös--Sós Conjecture (Q4631099) (← links)