Abstract
We give some improved estimates for the digraph Ramsey numbersr(Kn*,Lm), the smallest numberp such that any digraph of orderp either has an independent set ofn vertices or contains a transitive tournament of orderm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
