Zobrazeno 1 - 10
of 324
pro vyhledávání: '"Chen Yaojun"'
Autor:
Zhang, Yanbo, Chen, Yaojun
As a significant variation of Ramsey numbers, the Gallai-Ramsey number $GR_k(H)$ refers to the smallest positive integer $r$ such that, by coloring the edges of $K_r$ with at most $k$ colors, there exists either a monochromatic subgraph isomorphic to
Externí odkaz:
http://arxiv.org/abs/2410.01549
Let $\mathcal{H}$ be a family of graphs. The generalized Tur\'an number $ex(n, K_r, \mathcal{H})$ is the maximum number of copies of the clique $K_r$ in any $n$-vertex $\mathcal{H}$-free graph. In this paper, we determine the value of $ex(n, K_r, \{P
Externí odkaz:
http://arxiv.org/abs/2409.10129
The isolated toughness variant is a salient parameter for measuring the vulnerability of networks, which is inherently related to fractional factors (used to characterize the feasibility of data transmission). The combination of minimum degree and th
Externí odkaz:
http://arxiv.org/abs/2408.10847
Publikováno v:
Open Physics, Vol 16, Iss 1, Pp 889-895 (2018)
In the networking designing phase, the network needs to be built according to certain indicators to ensure that the network has the ideal functions and can work smoothly. From a modeling perspective, each site in the network is represented by a verte
Externí odkaz:
https://doaj.org/article/7767d03e38f24b4aa43e3549aa98ee0a
Publikováno v:
Open Physics, Vol 16, Iss 1, Pp 544-553 (2018)
In data transmission networks, the availability of data transmission is equivalent to the existence of the fractional factor of the corresponding graph which is generated by the network. Research on the existence of fractional factors under specific
Externí odkaz:
https://doaj.org/article/d15519dc045449d8892b6c847730d6fd
Autor:
Zhang, Yanbo, Chen, Yaojun
Given two graphs $G_1$ and $G_2$, the Ramsey number $r(G_1,G_2)$ refers to the smallest positive integer $N$ such that any graph $G$ with $N$ vertices contains $G_1$ as a subgraph, or the complement of $G$ contains $G_2$ as a subgraph. A connected gr
Externí odkaz:
http://arxiv.org/abs/2310.13204
The generalized Tur\'an number $\ex(n,K_s,F)$ denotes the maximum number of copies of $K_s$ in an $n$-vertex $F$-free graph. Let $kF$ denote $k$ disjoint copies of $F$. Gerbner, Methuku and Vizer [DM, 2019, 3130-3141] gave a lower bound for $\ex(n,K_
Externí odkaz:
http://arxiv.org/abs/2309.09603
Autor:
Zhu, Xiutao, Chen, Yaojun
For a family of graphs $\F$, a graph is called $\F$-free if it does not contain any member of $\F$ as a subgraph. The generalized Tur\'an number $\ex(n,K_r,\F)$ is the maximum number of $K_r$ in an $n$-vertex $\F$-free graph and $\ex(n,K_2,\F)=\ex(n,
Externí odkaz:
http://arxiv.org/abs/2307.11983
The Tur\'an number of a graph $F$ is the maximum number of edges in any graph on $n$ vertices containing no $F$ as a subgraph. Let $P_{\ell}$, $S_{\ell-1}$ denote the path and star on $\ell$ vertices, respectively. A linear forest, denoted by $\matho
Externí odkaz:
http://arxiv.org/abs/2305.11680
Autor:
Wang, Lanchao, Chen, Yaojun
Let $G$ be a graph with $n$ vertices. The {\em hat guessing number} of $G$ is defined in terms of the following game: There are $n$ players and one opponent. The opponent will wear one of the $q$ hats of different colors on the player's head. At this
Externí odkaz:
http://arxiv.org/abs/2302.04122