Raphael Yuster

activity

20232026

most citedFlip colouring of graphs

1 citations · 1 across the 12 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

Acyclic subgraphs of digraphs with high chromatic number

Raphael Yuster

For a digraph $G$ , let $f (G)$ be the maximum chromatic number of an acyclic subgraph of $G$ . For an $n$ -vertex digraph $G$ it is proved that $f (G) \geq n^{5/9 - o (1)} s^{- 14/9}$ where…

math.CO2025

Inducibility in $H$ -free graphs and inducibility of Turán graphs

Raphael Yuster

For graphs $F$ and $H$ , let $i (F)$ denote the inducibility of $F$ and let $i_{H} (F)$ denote the inducibility of $F$ over $H$ -free graphs. We prove that for almost all graphs $F$ on a…

Acyclic subgraphs of digraphs with high chromatic number

Inducibility in H-free graphs and inducibility of Turán graphs

Inducibility in $H$ -free graphs and inducibility of Turán graphs