Menglong Zhang

works on

erdos-ko-rado theorem 1 extremal combinatorics 1 hypergraph matchings 1 intersecting families 1 t-intersecting 1

From the 1 of 4 linked papers with an AI index.

collaborators

4 papers

cs.IT2026

Bounds and constructions for constant/low-power error-correcting cooling codes

Shuangqing Liu, Tingting Tong, Menglong Zhang +2

The low-power error-correcting cooling (LPECC) codes and constant-power error-correcting cooling (CPECC) codes, introduced in [IEEE Trans. Inf. Theory, 64 (2018), 3062--3085; 66 (2…

math.CO2026

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…

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, I^»)$ -perfect difference family (PDF) is a collection $F$ of $k$ -subsets of ${0, 1, \dots, v - 1}$ such that the multiset $\bigcup…

math.CO2025

Progress towards generalized Nash-Williams' conjecture on $K_{4}$ -decompositions

Menglong Zhang, Gennian Ge

A $K_{4}$ -decomposition of a graph is a partition of its edges into $K_{4}$ s. A fractional $K_{4}$ -decomposition is an assignment of a nonnegative weight to each $K_{4}$ in a graph such th…

Bounds and constructions for constant/low-power error-correcting cooling codes

ErdÅs-Ko-Rado-type problem for hypergraph matchings

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

Progress towards generalized Nash-Williams' conjecture on K4​-decompositions

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

Progress towards generalized Nash-Williams' conjecture on $K_{4}$ -decompositions