Name
Abstract | ||
|---|---|---|
The isometric Ramsey number IR(H ->) of a family H -> of digraphs is the smallest number of vertices in a graph G such that any orientation of the edges of G contains every member of H -> in the distance-preserving way. We observe that the isometric Ramsey number of a finite family of finite acyclic digraphs is always finite, and present some bounds in special cases. For example, we show that the isometric Ramsey number of the family of all oriented trees with n vertices is at most n2n+o(n). |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1002/jgt.22513 | JOURNAL OF GRAPH THEORY |
Keywords | DocType | Volume |
chromatic number,directed tree,girth,isometric embedding,orientation of a graph | Journal | 94.0 |
Issue | ISSN | Citations |
2.0 | 0364-9024 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Taras O. Banakh | 1 | 9 | 7.24 |
| Adam Idzik | 2 | 0 | 0.34 |
| Oleg Pikhurko | 3 | 318 | 47.03 |
| Igor Protasov | 4 | 0 | 2.70 |
| Krzysztof Pszczoła | 5 | 0 | 0.34 |