1 problem
Matching
Let be the three-color directed Ramsey number, and let an acyclic digraph have maximum degree at most . Three-color directed-Ramsey conjecture…
Let be the three-color directed Ramsey number, and let an acyclic digraph have maximum degree at most . Three-color directed-Ramsey conjecture…