Tingzeng Wu

dblp:57/2889 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
3since 2021 · last 2026
0000-0003-2488-9775ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 5 · 2 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1
YearPublicationVenuePosition
2026 Maximal non-empty cross s -union families
abstract
Two families of sets F and G are said to be cross s -union if for any F ∈ F and G ∈ G , | F ∪ G | ≤ s . In 2021, Frankl and Wong proved that if F , G ⊆ 2 [ n ] are non-empty cross s -union, then | F | + | G | ≤ ∑ i = 0 s n i + 1 . Moreover, for s < n − 1 , equality holds if and only if F , G = { 0̸ } , { G ⊆ [ n ] : | G | ≤ s } . In this paper, we give a new method to prove this result. Our method also allows us to establish a vector space version and a hereditary family extension. As a byproduct, we revisit the vector space version of the Katona s -union theorem due to Frankl and Tokushige, and characterize the extremal families for the case s = n − 1 .
Yongjiang Wu, Zhiyi Liu, Lihua Feng, Tingzeng Wu
Discret. Appl. Math.5
2026 On complexity of substructure connectivity and restricted connectivity of graphs
Huazhong Lü, Tingzeng Wu
J. Parallel Distributed Comput.2
2025 Two problems on Laplacian ratios of trees
Tingzeng Wu, Xiangshuai Dong, Hong-Jian Lai
Discret. Appl. Math.1
2020 On the conjecture of bijection between perfect matching and sub-hypercube in folded hypercubes
Huazhong Lü, Tingzeng Wu
Discret. Appl. Math.2
2019 Edge-disjoint Hamiltonian cycles of balanced hypercubes
Huazhong Lü, Tingzeng Wu
Inf. Process. Lett.2
2016 Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
Tingzeng Wu, Heping Zhang
Discret. Appl. Math.1