Yuting Tian

activity

20242026

collaborators

4 papers

math.CO2026

Rainbow triangles in edge-colored graphs with large minimum color degree

Bo Ning, Yuting Tian

Let $G$ be an edge-colored graph on $n$ vertices, and let $\deltac(G)$ denote its minimum color degree. Li and, independently Li, Ning, Xu, and Zhang, proved that every edge-colore…

math.CO2025

Two conjectures on vertex-disjoint rainbow triangles

Xu Liu, Bo Ning, Yuting Tian

In 1963, Dirac proved that every $n$ -vertex graph has $k$ vertex-disjoint triangles if $n \geq 3 k$ and minimum degree $I^´ (G) \geq \frac{n + k}{2}$ . The base case $n = 3 k$ can be reduced…

math.RT2024

Non-injective inductions and restrictions of modules over finite groups

Conghui Li, Yuting Tian

In this note, we extend the inductions and restrictions of modules over finite groups to non-injective group homomorphisms, establishing transitivity, Frobenius reciprocity, Mackey…

math.CO2024

The minimum number of maximal independent sets in graphs with given order and independence number

Yuting Tian, Jianhua Tu

Let $M I S (G)$ be the set of all maximal independent sets in a graph $G$ , and let $mi s (G) = ∣ M I S (G) ∣$ . In this paper, we show that for any tree $T$ with $n$ vertices and independence n…