Xingxing Yu

activity

20162021

most citedGraph-Based Radio Resource Management for Vehicular Networks

2 citations · 6 across the 12 of their papers we have counts for

collaborators

20 papers

math.CO2021

Co-degree threshold for rainbow perfect matchings in uniform hypergraphs

Hongliang Lu, Yan Wang, Xingxing Yu

Let $k$ and $n$ be two integers, with $k \geq 3$ , $n \equiv 0 (mod k)$ , and $n$ sufficiently large. We determine the $(k - 1)$ -degree threshold for the existence of a rainbow perfect ma…

math.CO2021★ 1 cited

Rainbow perfect matchings for 4-uniform hypergraphs

Hongliang Lu, Yan Wang, Xingxing Yu

Let $n$ be a sufficiently large integer with $n \equiv 0 (mod 4)$ and let $F_{i} \subseteq (4 [ n ])$ where $i \in [n /4]$ . We show that if each vertex of $F_{i}$ is contained in more…

math.CO2021★ 1 cited

Number of Hamiltonian cycles in planar triangulations

Xiaonan Liu, Xingxing Yu

Whitney proved in 1931 that 4-connected planar triangulations are Hamiltonian. Hakimi, Schmeichel, and Thomassen conjectured in 1979 that if $G$ is a 4-connected planar triangulati…

math.CO2021

A note on exact minimum degree threshold for fractional perfect matchings

Hongliang Lu, Xingxing Yu

Rödl, Ruciński, and Szemerédi determined the minimum $(k - 1)$ -degree threshold for the existence of fractional perfect matchings in $k$ -uniform hypergrahs, and Kühn, Osthus, and Tow…

math.CO2020

On the rainbow matching conjecture for 3-uniform hypergraphs

Jun Gao, Hongliang Lu, Jie Ma +1

Aharoni and Howard, and, independently, Huang, Loh, and Sudakov proposed the following rainbow version of Erdős matching conjecture: For positive integers $n, k, m$ with $n \geq k m$ , i…

math.CO2020

Partitioning digraphs with outdegree at least 4

Guanwu Liu, Xingxing Yu

Scott asked the question of determining $c_{d}$ such that if $D$ is a digraph with $m$ arcs and minimum outdegree $d \geq 2$ then $V (D)$ has a partition $V_{1}, V_{2}$ such that $\min\left…