Tao Feng

activity

20242026

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2026

Erdős-Ko-Rado-type problem for hypergraph matchings

Binwei Zhao, Tao Feng, Xiaomiao Wang +1

Given integers $1 \leq t \leq k$ , a family of $k$ -matchings in a complete $r$ -partite $r$ -uniform hypergraph is said to be $t$ -intersecting if any two of its members share at least $…

math.CO2026

The maximum size of the partial ground set of skew Bollobás systems

Yu Fang, Tao Feng, Xiaomiao Wang

A skew Bollobás system $P = {(A_{i}, B_{i}) : 1 \leq i \leq m}$ is a collection of pairs of disjoint subsets of $[n]$ such that $A_{i} \cap B_{j} \neq = \emptyset$ for any $1 \leq i < j \leq m$ …

math.CO2025

Perfect difference families, perfect systems of difference sets and their applications

Hengrui Liu, Tao Feng, Xiaomiao Wang +1

Let $v$ be a positive odd integer. A $(v, k, λ)$ -perfect difference family (PDF) is a collection $F$ of $k$ -subsets of ${0, 1, \dots, v - 1}$ such that the multiset $\bigcup_…

math.CO2024

Variations on Bollobás systems of $d$ -partitions

Yu Fang, Xiaomiao Wang, Tao Feng

This paper investigates five kinds of systems of $d$ -partitions of $[n]$ , including symmetric Bollobás systems, strong Bollobás systems, Bollobás systems, skew Bollobás systems, an…

math.CO2024

Embedding arbitrary edge-colorings of hypergraphs into regular colorings

Xiaomiao Wang, Tao Feng, Shixin Wang

For $r = (r_{1}, \dots, r_{k})$ , an $r$ -factorization of the complete $λ$ -fold $h$ -uniform $n$ -vertex hypergraph $λ K_{n}^{h}$ is a partition of the edges of $λ K_{n}^{h}$ into $F…

Erdős-Ko-Rado-type problem for hypergraph matchings

The maximum size of the partial ground set of skew Bollobás systems

Perfect difference families, perfect systems of difference sets and their applications

Variations on Bollobás systems of d-partitions

Embedding arbitrary edge-colorings of hypergraphs into regular colorings

Variations on Bollobás systems of $d$ -partitions