Z. Yin

activity

20212023

collaborators

4 papers

math.CO2023

The degree threshold for covering with all the connected $3$ -graphs with $3$ edges

Yue Ma, Xinmin Hou, Zhi Yin

Given two $r$ -uniform hypergraphs $F$ and $H$ , we say that $H$ has an $F$ -covering if every vertex in $H$ is contained in a copy of $F$ . Let $c_{i} (n, F)$ be the least integer such…

math.CO2022

An extension on neighbor sum distinguishing total coloring of graphs

Jing-zhi Chang, Chao Yang, Zhi-xiang Yin +1

Let $f : V (G) \cup E (G) \to {1, 2, \dots, k}$ be a non-proper total $k$ -coloring of $G$ . Define a weight function on total coloring as $$ϕ(x)=f(x)+\sum\limits_{e\ni x}f(e)+\sum…

math.CO2021

Rainbow independent sets in graphs with maximum degree two

Yue Ma, Xinmin Hou, Jun Gao +2

Given a graph $G$ , let $f_{G} (n, m)$ be the minimal number $k$ such that every $k$ independent $n$ -sets in $G$ have a rainbow $m$ -set. Let $D (2)$ be the family of all grap…

math.CO2021

A note on 1-2-3 and 1-2 Conjectures for 3-regular graphs

Jing-zhi Chang, Chao Yang, Zhi-xiang Yin +1

The 1-2-3 Conjecture, posed by Karoński, Łuczak and Thomason, asked whether every connected graph $G$ different from $K_{2}$ can be 3-edge-weighted so that every two adjacent vertice…

The degree threshold for covering with all the connected 3-graphs with 3 edges

An extension on neighbor sum distinguishing total coloring of graphs

Rainbow independent sets in graphs with maximum degree two

A note on 1-2-3 and 1-2 Conjectures for 3-regular graphs

The degree threshold for covering with all the connected $3$ -graphs with $3$ edges