Chong Shangguan

activity

20182026

most citedImproved List-Decodability of Reed--Solomon Codes via Tree Packings

4 citations · 8 across the 11 of their papers we have counts for

collaborators

Showing math.COShow all

7 papers · 1 filter

math.CO2026

An Erdős Matching Conjecture for Vector Spaces

Baoyan Feng, Chong Shangguan, Yulin Yang +1

We study a vector-space analogue of the Erdős Matching Conjecture. Let $m_{q} (n, k, s)$ denote the maximum cardinality of a family of $k$ -dimensional subspaces of an $n$ -dimensional ve…

math.CO2026

Balanced Sperner families via the topological Tverberg theorem

Chong Shangguan, Zixiang Xu, Yulin Yang

For every prime power $r \geq 2$ , we show that any Sperner family $F \subseteq 2^{[n]}$ with $∣ F ∣ \geq (r - 1) n + 1$ contains $r$ pairwise disjoint nonempty subfamilies wh…

math.CO2022★ 2 cited

Degenerate Turán densities of sparse hypergraphs II: a solution to the Brown-Erdős-Sós problem for every uniformity

Chong Shangguan

For fixed integers $r \geq 3, e \geq 3$ , and $v \geq r + 1$ , let $f_{r} (n, v, e)$ denote the maximum number of edges in an $n$ -vertex $r$ -uniform hypergraph in which the union of arbitrary $e$ …

math.CO2020

New Turán exponents for two extremal hypergraph problems

Chong Shangguan, Itzhak Tamo

An $r$ -uniform hypergraph is called $t$ -cancellative if for any $t + 2$ distinct edges $A_{1}, \dots, A_{t}, B, C$ , it holds that $(\cup_{i = 1}^{t} A_{i}) \cup B \neq = (\cup_{i = 1}^{t} A_{i}) \cup C$ . It…

math.CO2019

Degenerate Turán densities of sparse hypergraphs

Chong Shangguan, Itzhak Tamo

For fixed integers $r > k \geq 2, e \geq 3$ , let $f_{r} (n, er - (e - 1) k, e)$ be the maximum number of edges in an $r$ -uniform hypergraph in which the union of any $e$ distinct edges contains at…

math.CO2019

Sparse Hypergraphs with Applications to Coding Theory

Chong Shangguan, Itzhak Tamo

For fixed integers $r \geq 3, e \geq 3, v \geq r + 1$ , an $r$ -uniform hypergraph is called $G_{r} (v, e)$ -free if the union of any $e$ distinct edges contains at least $v + 1$ vertices.…

math.CO2018

The hat guessing number of graphs

Noga Alon, Omri Ben-Eliezer, Chong Shangguan +1

Consider the following hat guessing game: $n$ players are placed on $n$ vertices of a graph, each wearing a hat whose color is arbitrarily chosen from a set of $q$ possible colors.…