Topics
KrivelevichPerson
We prove that, with high probability, any 2‐edge‐coloring of a random tournament on n vertices contains a monochromatic path of length \Omega(n/ \sqrt{log n}). This resolves a conjecture of Ben‐Eliezer, Krivelevich, and Sudakov and implies a nearly tight upper bound on the oriented size Ramsey number of a directed path
For given graphs $G_1,\ldots,G_k$, the size-Ramsey number $\hat{R}(G_1,\ldots,G_k)$ is the smallest ...
AbstractThe Ramsey number r(G) of a graph G is the minimum N such that every red–blue coloring of th...
Given an r-edge coloured complete graph Kn , how many monochromatic connected com- ponents does one ...
We prove that, with high probability, in every 2-edge-colouring of the random tournament on n vertic...
An oriented graph is a directed graph with no bi-directed edges, i.e. if xy is an edge then yx is no...
<p>Starting from an innocent Ramsey-theoretic question regarding directed paths in tournaments, we d...
AbstractGiven a graph H, the size Ramsey number re(H,q) is the minimal number m for which there is a...
AbstractLet T be a tournament and let c:e(T)→ {1,…,r} be an r-colouring of the edges of T. The assoc...
In this thesis, we study several variations of the following fundamental problem in Ramsey theory: G...
We show that in every two-colouring of the edges of the complete graph K_N there is a monochromatic ...
AbstractThe Ramsey number r(D1,…,Dk) of acyclic directed graphs D1,…,Dk is defined as the largest in...
The Ramsey number r(G) of a graph G is the smallest number n such that, in any two-colouring of the ...
AbstractWe call the tournament T an m-coloured tournament if the arcs of T are coloured with m colou...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
We prove that in every 2-colouring of the edges of KN there exists a monochromatic infinite path P s...
For given graphs $G_1,\ldots,G_k$, the size-Ramsey number $\hat{R}(G_1,\ldots,G_k)$ is the smallest ...
AbstractThe Ramsey number r(G) of a graph G is the minimum N such that every red–blue coloring of th...
Given an r-edge coloured complete graph Kn , how many monochromatic connected com- ponents does one ...
We prove that, with high probability, in every 2-edge-colouring of the random tournament on n vertic...
An oriented graph is a directed graph with no bi-directed edges, i.e. if xy is an edge then yx is no...
<p>Starting from an innocent Ramsey-theoretic question regarding directed paths in tournaments, we d...
AbstractGiven a graph H, the size Ramsey number re(H,q) is the minimal number m for which there is a...
AbstractLet T be a tournament and let c:e(T)→ {1,…,r} be an r-colouring of the edges of T. The assoc...
In this thesis, we study several variations of the following fundamental problem in Ramsey theory: G...
We show that in every two-colouring of the edges of the complete graph K_N there is a monochromatic ...
AbstractThe Ramsey number r(D1,…,Dk) of acyclic directed graphs D1,…,Dk is defined as the largest in...
The Ramsey number r(G) of a graph G is the smallest number n such that, in any two-colouring of the ...
AbstractWe call the tournament T an m-coloured tournament if the arcs of T are coloured with m colou...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
We prove that in every 2-colouring of the edges of KN there exists a monochromatic infinite path P s...
For given graphs $G_1,\ldots,G_k$, the size-Ramsey number $\hat{R}(G_1,\ldots,G_k)$ is the smallest ...
AbstractThe Ramsey number r(G) of a graph G is the minimum N such that every red–blue coloring of th...
Given an r-edge coloured complete graph Kn , how many monochromatic connected com- ponents does one ...
Add to ORKG