Matthew Kwan

collaborators

2 papers

math.CO2025

Edge-statistics beyond $1/ e$

Alexandr Grebennikov, Matthew Kwan

For integers $k$ and $ℓ$ , let $ind (k, ℓ)$ be the maximum proportion of $k$ -vertex subsets of a large graph that induce exactly $ℓ$ edges. The edge-statistic…

math.CO2025

No- $(k + 1)$ -in-line problem for large constant $k$

Alexandr Grebennikov, Matthew Kwan

How many points can be placed in an $n \times n$ grid so that every (affine) line contains at most $k$ points? We prove that for $n \geq k \geq 1 0^{37}$ the maximum number of points i…

Edge-statistics beyond 1/e

No-(k+1)-in-line problem for large constant k

Edge-statistics beyond $1/ e$

No- $(k + 1)$ -in-line problem for large constant $k$