Pages that link to "Item:Q1821795"
From MaRDI portal
The following pages link to An upper bound on the Ramsey number of trees (Q1821795):
Displaying 12 items.
- Upper bounds on number of steals in rooted trees (Q255260) (← links)
- On generalized Ramsey numbers for trees (Q1062076) (← links)
- Small order graph-tree Ramsey numbers (Q1112840) (← links)
- The smallest Ramsey numbers (Q1297442) (← links)
- Monochromatic coverings and tree Ramsey numbers (Q1322294) (← links)
- Upper bounds for a Ramsey theorem for trees (Q1343232) (← links)
- Constructing trees in bipartite graphs (Q1918569) (← links)
- Remarks on a Ramsey theory for trees (Q2392039) (← links)
- Highly connected monochromatic subgraphs (Q2477397) (← links)
- Splits with forbidden subgraphs (Q2666586) (← links)
- On splittable colorings of graphs and hypergraphs (Q3150170) (← links)
- Ramsey problems and their connection to tuŕan-type extremal problems (Q3990872) (← links)