4 papers · 1 filter
Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures
Bingchen Qian, Xin Wang, Gennian Ge
In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to positive elements among samples with as few tests a…
Improved Lower Bounds for Secure Codes and Related Structures
Bingchen Qian, Xin Wang, Gennian Ge
Secure codes are widely-studied combinatorial structures which were introduced for traitor tracing in broadcast encryption. To determine the maximum size of such structures is the…
On the minimal degree condition of graphs implying some properties of subgraphs
Bingchen Qian, Chengfei Xie, Gennian Ge
Erdős posed the problem of finding conditions on a graph that imply the largest number of edges in a triangle-free subgraph is equal to the largest number of edges in a biparti…
Some Results on -Turán-good Graphs
Bingchen Qian, Chengfei Xie, Gennian Ge
For a graph and a -chromatic graph if the Turán graph has the maximum number of copies of among all -vertex -free graphs (for large enough),…