2 citations · 3 across the 7 of their papers we have counts for
7 papers
Exact minimum codegree thresholds for -covering and -covering
Lei Yu, Xinmin Hou, Boyuan Liu +1
Given two -graphs and , an -covering of is a collection of copies of in such that each vertex of is contained in at least one copy of them. Let {$c_2(n…
Codegree threshold for tiling -graphs with two edges sharing exactly vertices
Lei Yu, Xinmin Hou
Given integer and a -graph , let be the minimum integer such that every -graph on vertices with codegree at least contains an -factor…
The size of -uniform hypergraphs with given matching number and codegree
Xinmin Hou, Lei Yu, Jun Gao +1
Determine the size of -graphs with given graph parameters is an interesting problem. Chvátal and Hanson (JCTB, 1976) gave a tight upper bound of the size of 2-graphs with restri…
Odd induced subgraphs in graphs with treewidth at most two
Xinmin Hou, Lei Yu, Jiaao Li +1
A long-standing conjecture asserts that there exists a constant such that every graph of order without isolated vertices contains an induced subgraph of order at least $c…
Comments on "Approximate Characterizations for the Gaussian Source Broadcast Distortion Region"
Lei Yu, Houqiang Li, Weiping Li
Recently, Tian et al. [1] considered joint source-channel coding of transmitting a Gaussian source over -user Gaussian broadcast channel, and derived an outer bound on the admis…
Distortion Bounds for Transmitting Correlated Sources with Common Part over MAC
Lei Yu, Houqiang Li, Chang Wen Chen
This paper investigates the joint source-channel coding problem of sending two correlated memoryless sources with common part over a memoryless multiple access channel (MAC). An in…