Yue Zhao

activity

20172022

collaborators

4 papers

math.CO2022

Decomposition of class II graphs into two class I graphs

Yan Cao, Guangming Jing, Rong Luo +3

Mkrtchyan and Steffen [J. Graph Theory, 70 (4), 473--482, 2012] showed that every class II simple graph can be decomposed into a maximum $Δ$ -edge-colorable subgraph and a matching.…

math.NT2018

Chudnovsky's formula for $1/ π$ revisited

Yue Zhao

The document contains an outline of a modular proof for Ramanujan-Chudnovsky identity.

math.CO2018

Enumeration on row-increasing tableaux of shape $2 \times n$

Rosena R. X. Du, Xiaojie Fan, Yue Zhao

Recently O. Pechenik studied the cyclic sieving of increasing tableaux of shape $2 \times n$ , and obtained a polynomial on the major index of these tableaux, which is a $q$ -analogue…

math.CO2017

Hamiltonicity of edge-chromatic critical graphs

Yan Cao, Guantao Chen, Suyun Jiang +2

Given a graph $G$ , denote by $Δ$ and $χ^{'}$ the maximum degree and the chromatic index of $G$ , respectively. A simple graph $G$ is called {\it edge- $Δ$ -critical} if $χ^\prime(G…

Decomposition of class II graphs into two class I graphs

Chudnovsky's formula for 1/π revisited

Enumeration on row-increasing tableaux of shape 2×n

Hamiltonicity of edge-chromatic critical graphs

Chudnovsky's formula for $1/ π$ revisited

Enumeration on row-increasing tableaux of shape $2 \times n$