Hyunwoo Lee

activity

20232026

collaborators

Showing 2025Show all

5 papers · 1 filter

math.CO2025

On Sidorenko exponents of hypergraphs

Hyunwoo Lee

For an $r$ -graph $F$ , define Sidorenko exponent $s (F)$ as $s (F) := sup {s \geq 0 : \exists r -graph H s.t. t_{F} (H) = t_{K_{r}^{(r)}} (H)^{s} > 0},$ where $t_{H_{1}} (H_{2})$ de…

math.CO2025

Spanning clique subdivisions in pseudorandom graphs

Hyunwoo Lee, Matías Pavez-Signé, Teo Petrov

In this paper, we study the appearance of a spanning subdivision of a clique in graphs satisfying certain pseudorandom conditions. Specifically, we show the following three results…

math.CO2025

On high discrepancy $1$ -factorizations of complete graphs

Jiangdong Ai, Fankang He, Seonghyuk Im +1

We proved that for every sufficiently large $n$ , the complete graph $K_{2 n}$ with an arbitrary edge signing $σ : E (K_{2 n}) \to {- 1, + 1}$ admits a high discrepancy $1$ -factor decom…

math.CO2025

Reconstructing hypergraph matching polynomials

Donggyu Kim, Hyunwoo Lee

By utilizing the recently developed hypergraph analogue of Godsil's identity by the second author, we prove that for all $n \geq k \geq 2$ , one can reconstruct the matching polynom…

math.CO2025

A quantitative improvement on the hypergraph Balog-Szemerédi-Gowers theorem

Hyunwoo Lee

In this note, we obtain a quantitative improvement on the hypergraph variant of the Balog-Szemerédi-Gowers theorem due to Sudakov, Szemerédi, and Vu [Duke Math. J.129.1 (2005): 129…

On Sidorenko exponents of hypergraphs

Spanning clique subdivisions in pseudorandom graphs

On high discrepancy 1-factorizations of complete graphs

Reconstructing hypergraph matching polynomials

A quantitative improvement on the hypergraph Balog-Szemerédi-Gowers theorem

On high discrepancy $1$ -factorizations of complete graphs