3 citations · 3 across the 2 of their papers we have counts for
2 papers
math.CO2021
All feedback arc sets of a random Turán tournament have n/k-k+1 disjoint k-cliques (and this is tight)
Safwat Nassar, Raphael Yuster
We look at structures that must be removed (or reversed) in order to make acyclic a given oriented graph. For a directed acyclic graph and an oriented graph , let b…
math.CO2018★ 3 cited
Acyclic subgraphs with high chromatic number
Safwat Nassar, Raphael Yuster
For an oriented graph , let denote the maximum chromatic number of an acyclic subgraph of . Let be the smallest integer such that every oriented graph with…