8 citations · 20 across the 11 of their papers we have counts for
12 papers
An improved lower bound for the van der Waerden number
Haitao Cao
For an integer , let be the least such that every red-blue coloring of contains either a nontrivial three-term arithmetic progression in blue or a nontri…
Constructions for supersaturation of eventown problems
Xiaolei Niu, Yinghui Hang, Haitao Cao
In this paper, we study the supersaturation problems of eventown. Given a family of subsets of an element set, let op denote the number of distinct…
The Hamilton-Waterloo problem on wreath product graph
L. Wang, H. Cao
The Hamilton-Waterloo problem is a problem of graph factorization. The Hamilton-Waterloo problem HWP asks for a -factorization of containing -factors a…
The spectrum for large sets of -GDDs of type
X. Niu, H. Cao, R. Javadi
In this paper, we completely solve the existence of large sets of -GDDs of type and the existence of a simple -GDD of type .
Non-existence of perfect binary sequences
X. Niu, H. Cao, K. Feng
Binary sequences with lower autocorrelation values have important applications in cryptography and communications. In this paper, we present all possible parameters for binary peri…
Some results on generalized strong external difference families
X. Lu, X. Niu, H. Cao
A generalized strong external difference family (briefly -GSEDF) was introduced by Paterson and Stinson in 2016. In this paper, we construct s…
Completing the spectrum of almost resolvable cycle systems with odd cycle length
L. Wang, H. Cao
In this paper, we construct almost resolvable cycle systems of order for odd . This completes the proof of the existence of almost resolvable cycle systems with odd…
Some new bounds of placement delivery arrays
X. Niu, H. Cao
Coded caching scheme is a technique which reduce the load during peak traffic times in a wireless network system. Placement delivery array (PDA in short) was first introduced by Ya…
The Optimal Placement Delivery Arrays
Minquan Cheng, Jing Jiang, Qifa Yan +2
In wireless networks, coded caching is an effective technique to reduce network congestion during peak traffic times. Recently, a new concept called placement delivery array (PDA)…
Constructions and bounds for separating hash families
X. Niu, H. Cao
In this paper, we present a new construction for strong separating hash families by using hypergraphs and obtain some optimal separating hash families. We also improve some previou…
The Hamilton-Waterloo problem with C8-factors and Cm-factors
L. Wang, H. Cao
In this paper, we almost completely solve the Hamilton-Waterloo problem with C8- factors and Cm-factors where the number of vertices is a multiple of 8m.
The Hamilton-Waterloo Problem for -factors and -factors
Li Wang, Fen Chen, Haitao Cao
The Hamilton-Waterloo problem asks for a 2-factorization of (for odd) or minus a -factor (for even) into -factors and -factors. We completely solve…