Zobrazeno 1 - 10
of 233
pro vyhledávání: '"DING Guoli"'
Autor:
Ding, Guoli, Qualls, Brittian
In this paper we prove that every sufficiently large 4-edge-connected graph contains the double cycle, $C_{2,r}$, as an immersion. In proving this, we develop a new tool we call a ring-decomposition. We also prove that linear edge-connectivity implie
Externí odkaz:
http://arxiv.org/abs/2410.04538
Let $G=(V,E)$ be a graph with four distinguished vertices, two sources $s_1, s_2$ and two sinks $t_1,t_2$, let $c:\, E \rightarrow \mathbb Z_+$ be a capacity function, and let ${\cal P}$ be the set of all simple paths in $G$ from $s_1$ to $t_1$ or fr
Externí odkaz:
http://arxiv.org/abs/2407.17821
In 1930, Ramsey proved that every infinite graph contains either an infinite clique or an infinite independent set as an induced subgraph. K\"{o}nig proved that every infinite graph contains either a ray or a vertex of infinite degree. In this paper,
Externí odkaz:
http://arxiv.org/abs/2211.06416
Autor:
Lewchalermvongs, Chanun, Ding, Guoli
Publikováno v:
In Advances in Applied Mathematics February 2025 163 Part A
Partitioning large matrices is an important problem in distributed linear algebra computing (used in ML among others). Briefly, our goal is to perform a sequence of matrix algebra operations in a distributed manner (whenever possible) on these large
Externí odkaz:
http://arxiv.org/abs/2106.15549
Autor:
Guo, Feng, Zhang, Nong, Feng, Xiaowei, Xie, Zhengzheng, Han, Changliang, Li, Yongle, Chen, Qinghua, Ding, Guoli
Publikováno v:
In Engineering Geology March 2024 331
Autor:
Ding, Guoli, Qin, Chengfu
The chain theorem of Tutte states that every 3-connected graph can be constructed from a wheel $W_n$ by repeatedly adding edges and splitting vertices. It is not difficult to prove the following strengthening of this theorem: every non-wheel 3-connec
Externí odkaz:
http://arxiv.org/abs/2012.13974
Ramsey proved that for every positive integer $n$, every sufficiently large graph contains an induced $K_n$ or $\overline{K}_n$. Among the many extensions of Ramsey's Theorem there is an analogue for connected graphs: for every positive integer $n$,
Externí odkaz:
http://arxiv.org/abs/2009.12503
Autor:
Banerjee, Avah, Ding, Guoli
In this paper we study the mincut problem in the online setting. We consider two distinct models: A) competitive analysis and B) regret analysis. In the competitive setting we consider the vertex arrival model; whenever a new vertex arrives it's neig
Externí odkaz:
http://arxiv.org/abs/2004.12223
Let $G=(V,E)$ be a multigraph. The {\em cover index} $\xi(G)$ of $G$ is the greatest integer $k$ for which there is a coloring of $E$ with $k$ colors such that each vertex of $G$ is incident with at least one edge of each color. Let $\delta(G)$ be th
Externí odkaz:
http://arxiv.org/abs/1906.06458