The Biased Odd Cycle Game. - Asaf Ferber; Roman Glebov; Michael Krivelevich; Hong Liu 010; Cory Palmer; Tomás Valla; Máté Vizer (Electron. J. Comb., 2013)

Extremal Graphs for Blow-Ups of Cycles and Trees. - Hong Liu 010 (Electron. J. Comb., 2013)

On the Turán Number of Forests. - Hong Liu 010; Bernard Lidický; Cory Palmer (Electron. J. Comb., 2013)

Large permutations and parameter testing. - Roman Glebov; Carlos Hoppen; Tereza Klimosová; Yoshiharu Kohayakawa; Daniel Král; Hong Liu 010 (CoRR, 2014)

Multicolor Ramsey numbers for triple systems. - Maria Axenovich; András Gyárfás; Hong Liu 010; Dhruv Mubayi (Discret. Math., 2014)

Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube. - József Balogh; Ping Hu 004; Bernard Lidický; Hong Liu 010 (Eur. J. Comb., 2014)

On the number of K4-saturating edges. - József Balogh; Hong Liu 010 (J. Comb. Theory B, 2014)

A sharp bound on the number of maximal sum-free sets. - József Balogh; Hong Liu 010; Maryam Sharifzadeh; Andrew Treglown (Electron. Notes Discret. Math., 2015)

Intersecting families of discrete structures are typically trivial. - József Balogh; Shagnik Das; Michelle Delcourt; Hong Liu 010; Maryam Sharifzadeh (J. Comb. Theory A, 2015)

Subdivisions of a large clique in C6-free graphs. - József Balogh; Hong Liu 010; Maryam Sharifzadeh (J. Comb. Theory B, 2015)

The typical structure of graphs with no large cliques. - József Balogh; Neal Bushaw; Maurício Collares Neto; Hong Liu 010; Robert Morris 001; Maryam Sharifzadeh (Comb., 2017)

Local Conditions for Exponentially Many Subdivisions. - Hong Liu 010; Maryam Sharifzadeh; Katherine Staden (Comb. Probab. Comput., 2017)

Densities in large permutations and parameter testing. - Roman Glebov; Carlos Hoppen; Tereza Klimosová; Yoshiharu Kohayakawa; Daniel Král'; Hong Liu 010 (Eur. J. Comb., 2017)

Proof of Komlós's conjecture on Hamiltonian subsets. - Jaehoon Kim; Hong Liu 010; Maryam Sharifzadeh; Katherine Staden (Electron. Notes Discret. Math., 2017)

The minimum number of triangles in graphs of given order and size. - Hong Liu 010; Oleg Pikhurko; Katherine Staden (Electron. Notes Discret. Math., 2017)

A proof of Mader's conjecture on large clique subdivisions in C4-free graphs. - Hong Liu 010; Richard Montgomery 001 (J. Lond. Math. Soc., 2017)

On Two Problems in Ramsey-Turán Theory. - József Balogh; Hong Liu 010; Maryam Sharifzadeh (SIAM J. Discret. Math., 2017)

Rainbow spanning trees in properly coloured complete graphs. - József Balogh; Hong Liu 010; Richard Montgomery 001 (Discret. Appl. Math., 2018)

Structure and Supersaturation for Intersecting Families. - József Balogh; Shagnik Das; Hong Liu 010; Maryam Sharifzadeh; Tuan Tran (Electron. J. Comb., 2019)

The number of multiplicative Sidon sets of integers. - Hong Liu 010; Péter Pál Pach (J. Comb. Theory A, 2019)

Edges not in any monochromatic copy of a fixed graph. - Hong Liu 010; Oleg Pikhurko; Maryam Sharifzadeh (J. Comb. Theory B, 2019)

A Degree Sequence Komlós Theorem. - Joseph Hyde; Hong Liu 010; Andrew Treglown (SIAM J. Discret. Math., 2019)

Two Conjectures in Ramsey-Turán Theory. - Jaehoon Kim; Younjin Kim; Hong Liu 010 (SIAM J. Discret. Math., 2019)

Stability and exact Turán numbers for matroids. - Hong Liu 010; Sammy Luo; Peter Nelson; Kazuhiro Nomoto (J. Comb. Theory B, 2020)

Tree decompositions of graphs without large bipartite holes. - Jaehoon Kim; Younjin Kim; Hong Liu 010 (Random Struct. Algorithms, 2020)

On the Maximum Number of Integer Colourings with Forbidden Monochromatic Sums. - Hong Liu 010; Maryam Sharifzadeh; Katherine Staden (Electron. J. Comb., 2021)

Well-mixing vertices and almost expanders. - Debsoumya Chakraborti; Jaehoon Kim; Jinha Kim; Minki Kim; Hong Liu 010 (CoRR, 2021)

The number of maximum primitive sets of integers. - Hong Liu 010; Péter Pál Pach; Richárd Palincza (Comb. Probab. Comput., 2021)

Groups with few maximal sum-free sets. - Hong Liu 010; Maryam Sharifzadeh (J. Comb. Theory A, 2021)

On the rational Turán exponents conjecture. - Dong Yeap Kang; Jaehoon Kim; Hong Liu 010 (J. Comb. Theory B, 2021)

Clique immersion in graphs without a fixed bipartite graph. - Hong Liu 010; Guanghui Wang 002; Donglei Yang (J. Comb. Theory B, 2022)

Polynomial Schur's Theorem. - Hong Liu 010; Péter Pál Pach; Csaba Sándor (Comb., 2022)

Crux and Long Cycles in Graphs. - John Haslegrave; Jie Hu; Jaehoon Kim; Hong Liu 010; Bingyu Luan; Guanghui Wang 002 (SIAM J. Discret. Math., 2022)

A proof of Frankl's conjecture on cross-union families. - Stijn Cambie; Jaehoon Kim; Hong Liu 010; Tuan Tran (Comb. Theory, 2023)

Shape of the asymptotic maximum sum-free sets in integer lattice grids. - Hong Liu 010; Guanghui Wang 002; Laurence Wilkes; Donglei Yang (Eur. J. Comb., 2023)

How to build a pillar: A proof of Thomassen's conjecture. - Irene Gil Fernández; Hong Liu 010 (J. Comb. Theory B, 2023)

Exponential Decay of Intersection Volume With Applications on List-Decodability and Gilbert-Varshamov Type Bound. - Jaehoon Kim; Hong Liu 010; Tuan Tran (IEEE Trans. Inf. Theory, 2023)

Disjoint isomorphic balanced clique subdivisions. - Irene Gil Fernández; Joseph Hyde; Hong Liu 010; Oleg Pikhurko; Zhuo Wu (J. Comb. Theory B, 2023)

Stability Through Non-Shadows. - Jun Gao 002; Hong Liu 010; Zixiang Xu (Comb., 2023)

Fractional Helly Theorem for Cartesian Products of Convex Sets. - Debsoumya Chakraborti; Jaehoon Kim; Jinha Kim; Minki Kim; Hong Liu 010 (Discret. Comput. Geom., 2023)

Many Hamiltonian subsets in large graphs with given density. - Stijn Cambie; Jun Gao 002; Hong Liu 010 (Comb. Probab. Comput., 2024)

On a rainbow extremal problem for color-critical graphs. - Debsoumya Chakraborti; Jaehoon Kim; Hyunwoo Lee; Hong Liu 010; Jaehyeon Seo (Random Struct. Algorithms, 2024)

Rainbow Cycles in Properly Edge-Colored Graphs. - Jaehoon Kim; Joonkyung Lee; Hong Liu 010; Tuan Tran (Comb., 2024)

Crux, space constraints and subdivisions. - Seonghyuk Im; Jaehoon Kim; Younjin Kim; Hong Liu 010 (J. Comb. Theory B, 2025)