10 citations · 33 across the 23 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.CO2013
Disjoint induced subgraphs of the same order and size
Béla Bollobás, Teeradej Kittipassorn, Bhargav Narayanan +1
For a graph , let be the largest integer for which there exist two vertex-disjoint induced subgraphs of each on vertices, both inducing the same number of edg…
math.CO2013★ 1 cited
Separating path systems
Victor Falgas-Ravry, Teeradej Kittipassorn, Dániel Korándi +2
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every -vertex graph admits a separating path system…
math.CO2013
Exactly -coloured complete infinite subgraphs
Bhargav Narayanan
Given an edge colouring of a graph with a set of colours, we say that the graph is (exactly) -coloured if each of the colours is used. The question of finding exactly -co…