Zobrazeno 1 - 10
of 547
pro vyhledávání: '"Wang, Shipeng"'
Let $G$ be an $n$-vertex triangle-free graph. The celebrated Mantel's theorem showed that $e(G)\leq \lfloor\frac{n^2}{4}\rfloor$. In 1962, Erd\H{o}s (together with Gallai), and independently Andr\'{a}sfai, proved that if $G$ is non-bipartite then $e(
Externí odkaz:
http://arxiv.org/abs/2404.07486
A graph $G$ is called $C_{2k+1}$-free if it does not contain any cycle of length $2k+1$. In 1981, Haggkvist, Faudree and Schelp showed that every $n$-vertex triangle-free graph with more than $\frac{(n-1)^2}{4}+1$ edges is bipartite. In this paper, w
Externí odkaz:
http://arxiv.org/abs/2307.07962
Autor:
Zeng, Zheni, Yin, Bangchen, Wang, Shipeng, Liu, Jiarui, Yang, Cheng, Yao, Haishen, Sun, Xingzhi, Sun, Maosong, Xie, Guotong, Liu, Zhiyuan
Natural language is expected to be a key medium for various human-machine interactions in the era of large language models. When it comes to the biochemistry field, a series of tasks around molecules (e.g., property prediction, molecule mining, etc.)
Externí odkaz:
http://arxiv.org/abs/2306.11976
Autor:
Wang, Shipeng, Li, Qingzhong, Cui, Lizhen, Yan, Zhongmin, Xu, Yonghui, Shi, Zhuan, Min, Xinping, Shen, Zhiqi, Yu, Han
Crowdsourcing, in which human intelligence and productivity is dynamically mobilized to tackle tasks too complex for automation alone to handle, has grown to be an important research topic and inspired new businesses (e.g., Uber, Airbnb). Over the ye
Externí odkaz:
http://arxiv.org/abs/2212.14676
Autor:
Zhao, Xin1,2 (AUTHOR), Wang, Shipeng1,2 (AUTHOR), Zhang, Hongrui1,2 (AUTHOR), Dong, Shengjun1,2 (AUTHOR), Chen, Jianhua1,2 (AUTHOR), Sun, Yongqiang1,2 (AUTHOR), Zhang, Yueyuan1 (AUTHOR), Liu, Quangang1,2 (AUTHOR) liuquangang007@126.com
Publikováno v:
BMC Genomics. 10/14/2024, Vol. 25 Issue 1, p1-23. 23p.
Autor:
Zhang, Hongrui1,2 (AUTHOR), Wang, Shipeng1,2 (AUTHOR), Zhao, Xin1,2 (AUTHOR), Dong, Shengjun1,2 (AUTHOR), Chen, Jianhua1,2 (AUTHOR), Sun, Yongqiang1,2 (AUTHOR), Sun, Qiaowei1,2 (AUTHOR), Liu, Quangang1,2 (AUTHOR) liuquangang007@126.com
Publikováno v:
BMC Plant Biology. 9/28/2024, Vol. 24 Issue 1, p1-18. 18p.
Let $F$ be an $(r+1)$-color critical graph with $r\geq 2$, that is, $\chi(F)=r+1$ and there is an edge $e$ in $F$ such that $\chi(F-e)=r$. Gerbner recently conjectured that every $n$-vertex maximal $F$-free graph with at least $(1-\frac{1}{r})\frac{n
Externí odkaz:
http://arxiv.org/abs/2205.00426
Autor:
Li, Yunbei, Chen, Yiwen, Kang, Lizan, Cao, Zhong, Lv, Jinghua, Wang, Shipeng, Guo, Chao, Wang, Junqiang
Publikováno v:
In Bioresource Technology November 2024 412
Publikováno v:
In Ocean Engineering 1 November 2024 311 Part 1
Publikováno v:
In Pattern Recognition November 2024 155