Ray Li

activity

20162022

most citedEfficient Near-Optimal Codes for General Repeat Channels

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

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2020

Hat Guessing Numbers of Degenerate Graphs

Xiaoyu He, Ray Li

Recently, Farnik asked whether the hat guessing number $HG (G)$ of a graph $G$ could be bounded as a function of its degeneracy $d$ , and Bosek, Dudek, Farnik, Grytczuk and Ma…

math.CO2019

On edge-ordered Ramsey numbers

Jacob Fox, Ray Li

An edge-ordered graph is a graph with a linear ordering of its edges. Two edge-ordered graphs are equivalent if their is an isomorphism between them preserving the ordering of the…

math.CO2019

Max-Cut in Degenerate $H$ -Free Graphs

Ray Li, Nitya Mani

We obtain several lower bounds on the $Max-Cut$ of $d$ -degenerate $H$ -free graphs. Let $f (m, d, H)$ denote the smallest $Max-Cut$ of an $H$ -free $d$ -degenerate grap…

math.CO2019

On Ramsey numbers of hedgehogs

Jacob Fox, Ray Li

The hedgehog $H_{t}$ is a 3-uniform hypergraph on vertices $1, \dots, t + (2 t)$ such that, for any pair $(i, j)$ with $1 \leq i < j \leq t$ , there exists a unique vertex $k > t$ such that…

Hat Guessing Numbers of Degenerate Graphs

On edge-ordered Ramsey numbers

Max-Cut in Degenerate H-Free Graphs

On Ramsey numbers of hedgehogs

Max-Cut in Degenerate $H$ -Free Graphs