3 papers
math.CO2020
Coloring graphs by translates in the circle
Pablo Candela, Carlos Catala, Robert Hancock +4
The fractional and circular chromatic numbers are the two most studied non-integral refinements of the chromatic number of a graph. Starting from the definition of a coloring base…
math.PR2019
Long paths and connectivity in {}-independent random graphs
A. Nicholas Day, Victor Falgas-Ravry, Robert Hancock
Given a graph , a probability measure on the subsets of the edge set of is said to be -independent if events determined by edge sets that are at graph distance at lea…
math.CO2018
The Maker-Breaker Rado game on a random set of integers
Robert Hancock
Given an integer-valued matrix of dimension and an integer-valued vector of dimension , the Maker-Breaker -game on a set of integers is the…