Bhargav Narayanan

activity

20232025

collaborators

Showing 2023Show all

2 papers · 1 filter

math.CO2023

Clique Supersaturation

Quentin Dubroff, Benjamin Gunby, Bhargav Narayanan +1

We study how many copies of a graph $F$ that another graph $G$ with a given number of cliques is guaranteed to have. For example, one of our main results states that for all $t\ge…

math.CO2023

Colouring random subgraphs

Boris Bukh, Michael Krivelevich, Bhargav Narayanan

We study several basic problems about colouring the $p$ -random subgraph $G_{p}$ of an arbitrary graph $G$ , focusing primarily on the chromatic number and colouring number of $G_{p}$ . I…