Zobrazeno 1 - 10
of 142
pro vyhledávání: '"Zhou Wenling"'
Liu and Ma [J. Combin. Theory Ser. B, 2018] conjectured that every $2$-connected non-bipartite graph with minimum degree at least $k+1$ contains $\lceil k/2\rceil $ cycles with consecutive odd lengths. In particular, they showed that this conjecture
Externí odkaz:
http://arxiv.org/abs/2410.00648
The uniform Tur\'an density $\pi_{1}(F)$ of a $3$-uniform hypergraph $F$ is the supremum over all $d$ for which there is an $F$-free hypergraph with the property that every linearly sized subhypergraph with density at least $d$. Determining $\pi_{1}(
Externí odkaz:
http://arxiv.org/abs/2305.11749
A $k$-graph (or $k$-uniform hypergraph) $H$ is uniformly dense if the edge distribution of $H$ is uniformly dense with respect to every large collection of $k$-vertex cliques induced by sets of $(k-2)$-tuples. Reiher, R\"odl and Schacht [Int. Math. R
Externí odkaz:
http://arxiv.org/abs/2305.01305
Publikováno v:
European Journal of Combinatorics (2022)
In this paper, we study the rainbow Erd\H{o}s-Rothschild problem with respect to $k$-term arithmetic progressions. For a set of positive integers $S \subseteq [n]$, an $r$-coloring of $S$ is \emph{rainbow $k$-AP-free} if it contains no rainbow $k$-te
Externí odkaz:
http://arxiv.org/abs/2203.12735
Given $k\ge 2$ and two $k$-graphs ($k$-uniform hypergraphs) $F$ and $H$, an \emph{$F$-factor} in $H$ is a set of vertex disjoint copies of $F$ that together covers the vertex set of $H$. Lenz and Mubayi studied the $F$-factor problems in quasi-random
Externí odkaz:
http://arxiv.org/abs/2111.14140
Autor:
Zhang, Xiya, Wang, Aixia, Li, Jiaxin, Shan, Yimeng, Gong, Xue, Yao, Hanlin, Zhou, Wenling, Wang, Manxing, Liang, Bangqi, Wang, Fengzhong, Tong, Li-Tao
Publikováno v:
In Innovative Food Science and Emerging Technologies August 2024 96
Given $k\ge 2$ and two $k$-graphs ($k$-uniform hypergraphs) $F$ and $H$, an $F$-factor in $H$ is a set of vertex-disjoint copies of $F$ that together covers the vertex set of $H$. Lenz and Mubayi [J. Combin. Theory Ser. B, 2016] studied the $F$-facto
Externí odkaz:
http://arxiv.org/abs/2108.10731
Autor:
Zhou, Wenling
A rainbow matching in an edge-colored graph is a matching in which no two edges have the same color. The color degree of a vertex v is the number of different colors on edges incident to v. Kritschgau [Electron. J. Combin. 27(2020)] studied the exist
Externí odkaz:
http://arxiv.org/abs/2105.10632
Autor:
Zhou, Wenling, Li, Binlong
Let $\overrightarrow{P_k}$ and $\overrightarrow{C_k}$ denote the directed path and the directed cycle of order $k$, respectively. In this paper, we determine the precise maximum size of $\overrightarrow{P_k}$-free digraphs of order $n$ as well as the
Externí odkaz:
http://arxiv.org/abs/2102.10529
For a set of positive integers $A \subseteq [n]$, an $r$-coloring of $A$ is rainbow sum-free if it contains no rainbow Schur triple. In this paper we initiate the study of the rainbow Erd\H{o}s-Rothchild problem in the context of sum-free sets, which
Externí odkaz:
http://arxiv.org/abs/2005.14384