K. Yang

most citedAn extension of Mantel's theorem to random 4-uniform hypergraphs

1 citations · 1 across the 1 of their papers we have counts for

collaborators

5 papers

math.CO2014★ 1 cited

An extension of Mantel's theorem to random 4-uniform hypergraphs

Ran Gu, Xueliang Li, Zhongmei Qin +2

A sparse version of Mantel's Theorem is that, for sufficiently large $p$ , with high probability (w.h.p.), every maximum triangle-free subgraph of $G (n, p)$ is bipartite. DeMarco and…

math.CO2013

Graphs with $4$ -rainbow index $3$ and $n - 1$

Xueliang Li, Ingo Schiermeyer, Kang Yang +1

Let $G$ be a nontrivial connected graph with an edge-coloring $c : E (G) \to {1, 2, \dots, q},$ $q \in N$ , where adjacent edges may be colored the same. A tree $T$ in $…

math.CO2013

Non-jumping Numbers for 5-Uniform Hypergraphs

Ran Gu, Xueliang Li, Zhongmei Qin +2

Let $ℓ$ and $r$ be integers. A real number $α \in [0, 1)$ is a jump for $r$ if for any $ε > 0$ and any integer $m, m \geq r$ , any $r$ -uniform graph with $n > n_0(\varep…

math.CO2013

Graphs with 3-rainbow index $n - 1$ and $n - 2$

Xueliang Li, Kang Yang, Yan Zhao

Let $G$ be a nontrivial connected graph with an edge-coloring $c : E (G) \to {1, 2, \dots, q},$ $q \in N$ , where adjacent edges may be colored the same. A tree $T$ in $…

math.CO2013

The 3-rainbow index of a graph

Lily Chen, Xueliang Li, Kang Yang +1

Let $G$ be a nontrivial connected graph with an edge-coloring $c : E (G) \to {1, 2, ..., q},$ $q \in N$ , where adjacent edges may be colored the same. A tree $T$ in $G…

An extension of Mantel's theorem to random 4-uniform hypergraphs

Graphs with 4-rainbow index 3 and n−1

Non-jumping Numbers for 5-Uniform Hypergraphs

Graphs with 3-rainbow index n−1 and n−2

The 3-rainbow index of a graph

Graphs with $4$ -rainbow index $3$ and $n - 1$

Graphs with 3-rainbow index $n - 1$ and $n - 2$