Hou Tin Chau

collaborators

3 papers

math.CO2025

Graphs with Independent Exact $r$ -covers for all $r$

Hou Tin Chau

For every natural number $d$ , we construct finite $d$ -regular simple graphs that, for every $r \leq d$ , contain an independent exact $r$ -cover. This answers a question of Gray and J…

math.CO2024

On the maximum degree of induced subgraphs of the Kneser graph

Hou Tin Chau, David Ellis, Ehud Friedgut +1

For integers $n \geq k \geq 1$ , the {\em Kneser graph} $K (n, k)$ is the graph with vertex-set consisting of all the $k$ -element subsets of ${1, 2, \dots, n}$ , where two $k$ -element…

math.CO2024

Intersections of iterated shadows

Hou Tin Chau, David Ellis, Marius Tiba

We show that if $A \subset (n /2 [ n ])$ with measure bounded away from zero and from one, then the $I^c ◯ (n)$ -iterated upper shadows of $A$ and $\math…

Graphs with Independent Exact r-covers for all r

On the maximum degree of induced subgraphs of the Kneser graph

Intersections of iterated shadows

Graphs with Independent Exact $r$ -covers for all $r$