Abstract
AbstractThe isometric Ramsey number of a family of digraphs is the smallest number of vertices in a graph such that any orientation of the edges of contains every member of 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 vertices is at most .
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
