Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Xiaoyu He"'
The Longest Common Subsequence (LCS) is a fundamental string similarity measure, and computing the LCS of two strings is a classic algorithms question. A textbook dynamic programming algorithm gives an exact algorithm in quadratic time, and this is e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::124f8bd1fd395960095a4d71d666b6c9
http://arxiv.org/abs/2211.16660
http://arxiv.org/abs/2211.16660
Let $K_m^{(3)}$ denote the complete $3$-uniform hypergraph on $m$ vertices and $S_n^{(3)}$ the $3$-uniform hypergraph on $n+1$ vertices consisting of all $\binom{n}{2}$ edges incident to a given vertex. Whereas many hypergraph Ramsey numbers grow eit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6de1b84250c054f6f6d454489d47333
http://arxiv.org/abs/2210.03545
http://arxiv.org/abs/2210.03545
Publikováno v:
SIAM Journal on Discrete Mathematics. 35:1478-1502
Let $P_G(k)$ be the number of proper $k$-colorings of a finite simple graph $G$. Tomescu's conjecture, which was recently solved by Fox, He, and Manners, states that $P_G(k) \le k!(k-1)^{n-k}$ for all connected graphs $G$ on $n$ vertices with chromat
Publikováno v:
Combinatorics, Probability and Computing. 30:1-16
Given a fixed graph $H$, a real number $p\in(0,1)$, and an infinite Erd\H{o}s-R\'enyi graph $G\sim G(\infty,p)$, how many adjacency queries do we have to make to find a copy of $H$ inside $G$ with probability $1/2$? Determining this number $f(H,p)$ i
Publikováno v:
Random Structures & Algorithms. 57:1157-1173
We introduce a graph Ramsey game called Ramsey, Paper, Scissors. This game has two players, Proposer and Decider. Starting from an empty graph on $n$ vertices, on each turn Proposer proposes a potential edge and Decider simultaneously decides (withou
Publikováno v:
Discrete Mathematics. 342:2564-2569
The restricted ( m , n ; N ) -online Ramsey game is a game played between two players, Builder and Painter. The game starts with N isolated vertices. Each turn Builder picks an edge to build and Painter chooses whether that edge is red or blue, and B
The list Ramsey number $R_{\ell}(H,k)$, recently introduced by Alon, Buci\'c, Kalvari, Kuperwasser, and Szab\'o, is a list-coloring variant of the classical Ramsey number. They showed that if $H$ is a fixed $r$-uniform hypergraph that is not $r$-part
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6adb87f4b5eaf5ff8cceadc18f54f452
http://arxiv.org/abs/2103.15175
http://arxiv.org/abs/2103.15175
We prove that there exists an absolute constant $\delta>0$ such any binary code $C\subset\{0,1\}^N$ tolerating $(1/2-\delta)N$ adversarial deletions must satisfy $|C|\le 2^{\text{poly}\log N}$ and thus have rate asymptotically approaching 0. This is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a05ede80707d0cfe5e9e08cc8ad941e7
Recently, Farnik asked whether the hat guessing number $\mathrm{HG}(G)$ of a graph $G$ could be bounded as a function of its degeneracy $d$, and Bosek, Dudek, Farnik, Grytczuk and Mazur showed that $\mathrm{HG}(G)\ge 2^d$ is possible. We show that fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e79e052c71e19b538b1ef570f390bc5
http://arxiv.org/abs/2003.04990
http://arxiv.org/abs/2003.04990
The hat-guessing number is a graph invariant defined by Butler, Hajiaghayi, Kleinberg, and Leighton. We determine the hat-guessing number exactly for book graphs with sufficiently many pages, improving previously known lower bounds of He and Li and e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e4029ded901cf7facf649cc44c28baa0