1 citations · 1 across the 12 of their papers we have counts for
Showing 2024 · math.COShow all
3 papers · 2 filters
math.CO2024
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…
math.CO2024
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_…
math.CO2024
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.…