#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2013

2018

- This year (2)
- Last 5 years (10)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- BÃ©la BollobÃ¡s, Bhargav P. Narayanan, Andrei M. Raigorodskii
- J. Comb. Theory, Ser. A
- 2016

Delete the edges of a Kneser graph independently of each other with some probability: for what probabilities is the independence number of this random graph equal to the independence number of theâ€¦ (More)

- Bhargav P. Narayanan
- J. Comb. Theory, Ser. B
- 2014

Given an edge colouring of a graph with a set of m colours, we say that the graph is (exactly) m-coloured if each of the colours is used. The question of finding exactly m-coloured complete subgraphsâ€¦ (More)

- BÃ©la BollobÃ¡s, Teeradej Kittipassorn, Bhargav P. Narayanan, Alex D. Scott
- Eur. J. Comb.
- 2015

For a graph G, let f(G) be the largest integer k for which there exist two vertex-disjoint induced subgraphs of G each on k vertices, both inducing the same number of edges. We prove that f(G) â‰¥ n/2âˆ’â€¦ (More)

- Teeradej Kittipassorn, Bhargav P. Narayanan
- Combinatorics, Probability & Computing
- 2014

Given an edge colouring of a graph with a set of m colours, we say that the graph is (exactly) m-coloured if each of the colours is used. We consider edge colourings of the complete graph on N withâ€¦ (More)

- Paul N. Balister, BÃ©la BollobÃ¡s, Jonathan Lee, Bhargav P. Narayanan
- Random Struct. Algorithms
- 2018

- Teeradej Kittipassorn, Bhargav P. Narayanan
- Journal of Graph Theory
- 2015

Given an edge colouring of a graph with a set of m colours, we say that the graph is exactly m-coloured if each of the colours is used. In 1999, Stacey and Weidl, partially resolving a conjecture ofâ€¦ (More)

- Bhargav P. Narayanan, Julian Sahasrabudhe, IstvÃ¡n Tomon
- Combinatorica
- 2017

We investigate the following generalisation of the â€˜multiplication table problemâ€™ of ErdÅ‘s: given a bipartite graph with m edges, how large is the set of sizes of its induced subgraphs? ErdÅ‘sâ€™sâ€¦ (More)

- Bhargav P. Narayanan, IstvÃ¡n Tomon
- Combinatorics, Probability & Computing
- 2018

Let hom(G) denote the size of the largest clique or independent set of a graph G. In 2007, Bukh and Sudakov proved that every n-vertex graph G with hom(G) = O(log n) contains an induced subgraph withâ€¦ (More)

- Paul N. Balister, Scott Binski, BÃ©la BollobÃ¡s, Bhargav P. Narayanan
- J. Comb. Theory, Ser. A
- 2017

We study the problem of cops and robbers on the grid where the robber is allowed to move faster than the cops. It is a well-known fact that two cops are necessary and sufficient to catch the robberâ€¦ (More)

Given an edge colouring of a graph with a set of m colours, we say that the graph is exactly m-coloured if each of the colours is used. In 1996, Stacey and Weidl, partially resolving a conjecture ofâ€¦ (More)

- â€¹
- 1
- â€º