Zobrazeno 1 - 10
of 138
pro vyhledávání: '"Lee, Choongbum"'
This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader class, com
Externí odkaz:
http://arxiv.org/abs/1805.02238
We introduce a new method for location recovery from pair-wise directions that leverages an efficient convex program that comes with exact recovery guarantees, even in the presence of adversarial outliers. When pairwise directions represent scaled re
Externí odkaz:
http://arxiv.org/abs/1608.02165
Let $\mathcal G$ be a separable family of graphs. Then for all positive constants $\epsilon$ and $\Delta$ and for every sufficiently large integer $n$, every sequence $G_1,\dotsc,G_t\in\mathcal G$ of graphs of order $n$ and maximum degree at most $\D
Externí odkaz:
http://arxiv.org/abs/1512.08701
A bipartite graph $H$ is said to have Sidorenko's property if the probability that the uniform random mapping from $V(H)$ to the vertex set of any graph $G$ is a homomorphism is at least the product over all edges in $H$ of the probability that the e
Externí odkaz:
http://arxiv.org/abs/1510.06533
Let $t_1,\ldots,t_{n_l} \in \mathbb{R}^d$ and $p_1,\ldots,p_{n_s} \in \mathbb{R}^d$ and consider the bipartite location recovery problem: given a subset of pairwise direction observations $\{(t_i - p_j) / \|t_i - p_j\|_2\}_{i,j \in [n_l] \times [n_s]
Externí odkaz:
http://arxiv.org/abs/1509.05064
Autor:
Lee, Choongbum, Tran, Brandon
A simple graph-product type construction shows that for all natural numbers $r \ge q$, there exists an edge-coloring of the complete graph on $2^r$ vertices using $r$ colors where the graph consisting of the union of arbitrary $q$ color classes has c
Externí odkaz:
http://arxiv.org/abs/1507.04792
Let $t_1,\ldots,t_n \in \mathbb{R}^d$ and consider the location recovery problem: given a subset of pairwise direction observations $\{(t_i - t_j) / \|t_i - t_j\|_2\}_{i
Externí odkaz:
http://arxiv.org/abs/1506.01437
Autor:
Lee, Choongbum
A graph is $d$-degenerate if all its subgraphs have a vertex of degree at most $d$. We prove that there exists a constant $c$ such that for all natural numbers $d$ and $r$, every $d$-degenerate graph $H$ of chromatic number $r$ with $|V(H)| \ge 2^{d^
Externí odkaz:
http://arxiv.org/abs/1505.04773
Autor:
Lee, Choongbum
We investigate Ramsey numbers of bounded degree graphs and provide an interpolation between known results on the Ramsey numbers of general bounded degree graphs and bounded degree graphs of small bandwidth. Our main theorem implies that there exists
Externí odkaz:
http://arxiv.org/abs/1504.06285
Autor:
Lee, Choongbum
We develop a tool for embedding almost spanning degenerate graphs of small bandwidth. As an application, we extend the blow-up lemma to degenerate graphs of small bandwidth, the bandwidth theorem to degenerate graphs, and make progress on a conjectur
Externí odkaz:
http://arxiv.org/abs/1501.05350