Rahil Baber

activity

20102023

most citedGraph Guessing Games and non-Shannon Information Inequalities

4 citations · 4 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2023

A collection of open problems in celebration of Imre Leader's 60th birthday

Rahil Baber, Natalie Behague, Asier Calbet +10

One of the great pleasures of working with Imre Leader is to experience his infectious delight on encountering a compelling combinatorial problem. This collection of open problems…

cs.IT2014★ 4 cited

Graph Guessing Games and non-Shannon Information Inequalities

Rahil Baber, Demetres Christofides, Anh N. Dang +2

Guessing games for directed graphs were introduced by Riis for studying multiple unicast network coding problems. In a guessing game, the players toss generalised dice and can see…

math.CO2010

Hypergraphs do jump

Rahil Baber, John Talbot

We say that $α \in [0, 1)$ is a jump for an integer $r \geq 2$ if there exists $c (α) > 0$ such that for all $ε > 0$ and all $t \geq 1$ any $r$ -graph with $n \geq n_{0} (α, ε, t)$ vertices and d…