20 citations · 35 across the 7 of their papers we have counts for
7 papers
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…
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…
A solution to the 2/3 conjecture
Rahil Baber, John Talbot
We prove a vertex domination conjecture of Erd\H os, Faudree, Gould, Gyárfás, Rousseau, and Schelp, that for every n-vertex complete graph with edges coloured using three colours t…
Turán densities of hypercubes
Rahil Baber
In this paper we describe a number of extensions to Razborov's semidefinite flag algebra method. We will begin by showing how to apply the method to significantly improve the upper…
New Turán densities for 3-graphs
Rahil Baber, John Talbot
If is a family of graphs then the Turán density of is determined by the minimum chromatic number of the members of . The situation for Turá…
Hypergraphs do jump
Rahil Baber, John Talbot
We say that is a jump for an integer if there exists such that for all and all any -graph with vertices and d…
The minimal density of triangles in tripartite graphs
Rahil Baber, J. Robert Johnson, John Talbot
We determine the minimal density of triangles in a tripartite graph with prescribed edge densities. This extends a previous result of Bondy, Shen, Thomassé and Thomassen characteri…