Chuanyun Zang

activity

20152017

most citedMinimum vertex degree thresholds for tiling complete 3-partite 3-graphs

31 citations · 41 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2016★ 4 cited

Matchings in $k$ -partite $k$ -uniform Hypergraphs

Jie Han, Chuanyun Zang, Yi Zhao

For $k \geq 3$ and $ε > 0$ , let $H$ be a $k$ -partite $k$ -graph with parts $V_{1}, \dots, V_{k}$ each of size $n$ , where $n$ is sufficiently large. Assume that for each $i \in [k]$ , every $(k…

math.CO2015

The Strong Chromatic Index of graphs with maximum degree $Δ$

Chuanyun Zang

A strong edge-coloring of a graph $G$ is an edge-coloring such that no two edges of distance at most two receive the same color. The strong chromatic index $χ_{s}^{'} (G)$ is the minimum…

math.CO2015★ 31 cited

Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs

Jie Han, Chuanyun Zang, Yi Zhao

Given positive integers $a \leq b \leq c$ , let $K_{a, b, c}$ be the complete 3-partite 3-uniform hypergraph with three parts of sizes $a, b, c$ . Let $H$ be a 3-uniform hypergraph on $n$ …

Matchings in k-partite k-uniform Hypergraphs

The Strong Chromatic Index of graphs with maximum degree Δ

Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs

Matchings in $k$ -partite $k$ -uniform Hypergraphs

The Strong Chromatic Index of graphs with maximum degree $Δ$