From the 1 of 5 linked papers with an AI index.
5 papers
ErdÅs-Ko-Rado-type problem for hypergraph matchings
Binwei Zhao, Tao Feng, Xiaomiao Wang +1
The paper determines the largest possible size of families of k‑matchings in complete r‑partite r‑uniform hypergraphs that intersect in at least t edges, and characterizes the extr…
The maximum size of the partial ground set of skew Bollobás systems
Yu Fang, Tao Feng, Xiaomiao Wang
A skew Bollobás system is a collection of pairs of disjoint subsets of such that for any $1\leq i<j\leq m…
Perfect difference families, perfect systems of difference sets and their applications
Hengrui Liu, Tao Feng, Xiaomiao Wang +1
Let be a positive odd integer. A -perfect difference family (PDF) is a collection of -subsets of such that the multiset $\bigcup…
Variations on Bollobás systems of -partitions
Yu Fang, Xiaomiao Wang, Tao Feng
This paper investigates five kinds of systems of -partitions of , including symmetric Bollobás systems, strong Bollobás systems, Bollobás systems, skew Bollobás systems…
Embedding arbitrary edge-colorings of hypergraphs into regular colorings
Xiaomiao Wang, Tao Feng, Shixin Wang
For , an -factorization of the complete -fold -uniform -vertex hypergraph is a partition of the edges of into…