1 citations · 1 across the 12 of their papers we have counts for
12 papers
A Tight Erdős-Stone Bound for All Graph Densities
Asaf Shapira, Raphael Yuster
The Erdős--Stone Theorem asserts that if a graph has edge density then it contains a complete -partite graph with vertices in each part, where $b=b_n(r,δ) \gg…
On Ramsey Properties of k-Majority Tournaments
Asaf Shapira, Raphael Yuster
A central objective in Ramsey theory is determining whether restricted families of discrete structures necessarily contain substantially larger homogeneous substructures, compared…
On the maximum density of a matrix and a transcendental Turán-type density
Raphael Yuster
We prove that the inducibility of in ordered monotone balanced bipartite graphs is , establishing the smallest known graph with transcendental Turán-type density. More…
Acyclic subgraphs of digraphs with high chromatic number
Raphael Yuster
For a digraph , let be the maximum chromatic number of an acyclic subgraph of . For an -vertex digraph it is proved that where…
Inducibility in -free graphs and inducibility of Turán graphs
Raphael Yuster
For graphs and , let denote the inducibility of and let denote the inducibility of over -free graphs. We prove that for almost all graphs on a…
On the minimum density of monotone subwords
Raphael Yuster
We consider the asymptotic minimum density of monotone -subwords of words over a totally ordered alphabet of size . The unrestricted alphabet case, , is…
Path-monochromatic bounded depth rooted trees in (random) tournaments
Raphael Yuster
An edge-colored rooted directed tree (aka arborescence) is path-monochromatic if every path in it is monochromatic. Let be positive integers. For a tournament , let $f_…
Highly connected graphs have highly connected spanning bipartite subgraphs
Raphael Yuster
For integers with , let be the smallest integer such that every -connected -vertex graph has a spanning bipartite -connected subgraph.…
Flip colouring of graphs
Yair Caro, Josef Lauri, Xandru Mifsud +2
It is proved that for integers such that , there exists a red/blue edge-colored graph such that the red degree of every vertex is ,…
On tournament inversion
Raphael Yuster
An {\it inversion} of a tournament is obtained by reversing the direction of all edges with both endpoints in some set of vertices. Let be the minimum length o…
Packing and covering a given directed graph in a directed graph
Raphael Yuster
For every fixed , it is proved that if an -vertex directed graph has at most pairwise arc-disjoint directed -cycles, then there exists a set of at most $\frac{2}…
Finding and counting small tournaments in large tournaments
Raphael Yuster
We present new algorithms for counting and detecting small tournaments in a given tournament. In particular, it is proved that every tournament on four vertices (there are four) ca…