7 papers
Upper Bounds for CSP Non-redundancy via Locally Decodable Codes
Joshua Brakensiek, David Conlon, Venkatesan Guruswami +4
In the study of constraint satisfaction problems (CSPs), the non-redundancy of a relation measures the maximum number of clauses in a CSP instance which can be logically independen…
Sequence-Structured Decision Learning for Branch-and-Bound in Mixed-Integer Linear Programming
Tengfei Liu, Jinrun Liu, Bai Yan +2
Branch-and-bound (BnB) solves mixed-integer linear programs by constructing and exploring a search tree. Node selection and branching are two recurrent decisions that directly dete…
When are off-diagonal hypergraph Ramsey numbers polynomial?
David Conlon, Jacob Fox, Benjamin Gunby +5
A natural open problem in Ramsey theory is to determine those -graphs for which the off-diagonal Ramsey number grows polynomially with . We make substan…
Non-spherical sets versus lines in Euclidean Ramsey theory
David Conlon, Jakob Führer
We show that for every non-spherical set in , there exists a natural number and a red/blue-colouring of for every such that there is no red…
On off-diagonal hypergraph Ramsey numbers
David Conlon, Jacob Fox, Benjamin Gunby +4
A fundamental problem in Ramsey theory is to determine the growth rate in terms of of the Ramsey number of a fixed -uniform hypergraph versus the compl…
A question of Erdős and Graham on Egyptian fractions
David Conlon, Jacob Fox, Xiaoyu He +4
Answering a question of Erdős and Graham, we show that for each fixed positive rational number the number of ways to write as a sum of reciprocals of distinct positive inte…
More on lines in Euclidean Ramsey theory
David Conlon, Yu-Han Wu
Let be a sequence of points on a line with consecutive points at distance one. Answering a question raised by Fox and the first author and independently by Arman and T…