2 papers
math.CO2013
Approximations to -coloured complete infinite hypergraphs
Teeradej Kittipassorn, 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. In 1999, Stacey and Weidl, partially r…
math.CO2013
A canonical Ramsey theorem for exactly -coloured complete subgraphs
Teeradej Kittipassorn, 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. We consider edge colourings of the com…