6 citations · 8 across the 5 of their papers we have counts for
5 papers
The normalized Laplacian spectrum and eigentime identities of hype-cubes
Yangyang Chen, Yi Zhao
Many popular graph metrics encode average properties of individual network elements. Complementing these conventional graph metrics, the eigenvalue spectrum of the normalized Lapla…
A note on perfect matchings in uniform hypergraphs
Andrew Treglown, Yi Zhao
We determine the \emph{exact} minimum -degree threshold for perfect matchings in -uniform hypergraphs when the corresponding threshold for perfect fractional matchings is…
On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
Deryk Osthus, Daniela Kühn, Timothy Townsend +1
Motivated by his work on the classification of countable homogeneous oriented graphs, Cherlin asked about the typical structure of oriented graphs (i) without a transitive triangle…
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs II
Andrew Treglown, Yi Zhao
Given positive integers k\geq 3 and r where k/2 \leq r \leq k-1, we give a minimum r-degree condition that ensures a perfect matching in a k-uniform hypergraph. This condition is b…
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
Andrew Treglown, Yi Zhao
Given positive integers k and r where 4 divides k and k/2 \leq r \leq k-1, we give a minimum r-degree condition that ensures a perfect matching in a k-uniform hypergraph. This cond…