Ce Chen

most citedRamsey-Turán Problems with small independence numbers

1 citations · 1 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2022★ 1 cited

Ramsey-Turán Problems with small independence numbers

József Balogh, Ce Chen, Grace McCourt +1

Given a graph $H$ and a function $f (n)$ , the Ramsey-Turán number $R T (n, H, f (n))$ is the maximum number of edges in an $n$ -vertex $H$ -free graph with independence number at most $f(n…

math.CO2022

Maximal 3-wise Intersecting Families with Minimum Size: the Odd Case

József Balogh, Ce Chen, Haoran Luo

A family $F$ on ground set ${1, 2, \dots, n}$ is maximal $k$ -wise intersecting if every collection of $k$ sets in $F$ has non-empty intersection, and no other…

math.CO2021

Maximal $3$ -wise intersecting families

József Balogh, Ce Chen, Kevin Hendrey +4

A family $F$ on ground set $[n] := {1, 2, \dots, n}$ is maximal $k$ -wise intersecting if every collection of at most $k$ sets in $F$ has non-empty intersection,…

Ramsey-Turán Problems with small independence numbers

Maximal 3-wise Intersecting Families with Minimum Size: the Odd Case

Maximal 3-wise intersecting families

Maximal $3$ -wise intersecting families