Preprint
Marcin Brianski, Daniel Kráľ, Ander Lamaison , Xichao Shu, Four-coloring Eulerian triangulations of the torus
Ting-Wei Chao, Zichao Dong , Zhuo Wu , Empty red-red-blue triangles
Ander Lamaison , Zhuo Wu , The uniform Turán density of large stars
Dong Yeap Kang , Jungin Lee, Myungjun Yu, Random $p$-adic matrices with fixed zero entries and the Cohen–Lenstra distribution
Debsoumya Chakraborti, Minho Cho , Jinha Kim, Minki Kim, Colorful fractional Helly theorem via weak saturation
Ander Lamaison , Palettes determine uniform Turán density
Seonghyuk Im , Ruonan Li , Hong Liu , Sidorenko’s conjecture for subdivisions and theta substitutions
Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee , Jaehyeon Seo
, Transversal cycles and paths in tournaments
Laihao Ding , Ander Lamaison , Hong Liu , Shuaichao Wang , Haotian Yang , On $3$-graphs with vanishing codegree Turán density
Hyunwoo Lee , Random matchings in linear hypergraphs
Xinbu Cheng, Zixiang Xu , Bollobás-Erdős-Tuza conjecture for graphs with no induced $K_{s,t}$
Alexander Clifton, Hong Liu , Letícia Mattos, Michael Zheng, Subgraphs of random graphs in hereditary families
Irene Gil Fernández, Jaehoon Kim, Hong Liu , Oleg Pikhurko, New lower bound on ball packing density in high-dimensional hyperbolic spaces
Xinbu Cheng, Zixiang Xu , Sublinear hitting sets for some geometric graphs
Jaehoon Kim, Hong Liu , Péter Pál Pach, Optimal bounds on the polynomial Schur’s theorem
Jiangdong Ai, Hong Liu , Zixiang Xu , Qiang Zhou , Piercing independent sets in graphs without large induced matching
Hong Liu , Chong Shangguan, Jozef Skokan, Zixiang Xu , Beyond chromatic threshold via $(p,q)$-theorem, and sharp blow-up phenomenon
Daniel Kráľ, Matjaž Krnc, Ander Lamaison , Ramsey multiplicity of apices of trees
Seonghyuk Im, Hyunwoo Lee , Dirac’s theorem for linear hypergraphs
Jun Gao , Suyun Jiang , Hong Liu , Maya Sankar, Generalized Ramsey–Turán density for cliques
Ruonan Li , Ruhui Lu, Xueli Su, Shenggui Zhang, The absence of monochromatic triangle implies various properly colored spanning trees
József Balogh, Suyun Jiang , Haoran Luo, On the maximum number of r-cliques in graphs free of complete r-partite subgraphs
Seonghyuk Im , Suyun Jiang , Hong Liu , Tuan Tran, Graph with any rational density and no rich subsets of linear size
Jaehoon Kim, Hong Liu , Yantao Tang, Guanghui Wang, Donglei Yang, Fan Yang, Extremal density for subdivisions with length or sparsity constraints
Jaehoon Kim, Hyunwoo Lee , Dense triangle-free (n, d, λ)-graphs for all orders
Seonghyuk Im , Jaehoon Kim, Hyunwoo Lee , Haesong Seo
, On rainbow Turán Densities of Trees
Laihao Ding , Hong Liu , Shuaichao Wang , Haotian Yang , Vanishing codegree Turán density implies vanishing uniform Turán density
Jun Gao , Zhuo Wu , Yisai Xue , Counting cliques without generalized theta graphs
Hyunwoo Lee , Towards a high-dimensional Dirac’s theorem
Younjin Kim , Jihye Kwon, Hyang-Sook Lee, On Ideal Secret-Sharing Schemes for $k$-homogeneous access structures
Zhuo Wu , Jun Yan, Distribution of colours in rainbow $H$-free colourings
Stijn Cambie , Penny Haxell, Ross J. Kang, Ronen Wdowinski, A precise condition for independent transversals in bipartite covers
Stijn Cambie , Jun Gao , Younjin Kim , Hong Liu , The Erdős distinct subset sums problem in a modular setting
Stijn Cambie , Guantao Chen, Yanli Hao, Nizamettin Tokar, Decreasing the mean subtree order by adding $k$ edges
Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee , Jaehyeon Seo, Hamilton transversals in tournaments
Gennian Ge, Zixiang Xu , Yixuan Zhang, A new variant of the Erdős-Gyárfás problem on $K_5$
Stijn Cambie , Progress on the union-closed conjecture and offsprings in winter 2022-2023
Hyunwoo Lee , Spanning subdivisions in dense digraphs
Xinbu Cheng, Zixiang Xu , Euclidean Gallai-Ramsey for various configurations
Jaehoon Kim, Hyunwoo Lee , Covering multigraphs with bipartite graphs
David Conlon, Joonkyung Lee , Domination inequalities and dominating graphs
Stijn Cambie , Rimma Hämäläinen, Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
Stijn Cambie , Wouter Cames van Batenburg, Ewan Davies, Ross J. Kang, List packing number of bounded degree graphs
Debsoumya Chakraborti, Seonghyuk Im , Jaehoon Kim, Hong Liu , A bandwidth theorem for graph transversals
Hyunwoo Lee , On perfect subdivision tilings
Stijn Cambie , Ervin Győri, Nika Salia , Casey Tompkins, James Tuite, The maximum Wiener index of a uniform hypergraph
Xinbu Cheng, Meiqin Wang, Zixiang Xu , Exact values and improved bounds on k-neighborly families of boxes
Stijn Cambie , Better bounds for the union-closed sets conjecture using the entropy approach
Zequn Lv, Ervin Győri, Zhen He, Nika Salia , Chuanqi Xiao, Xiutao Zhu, The maximum number of cliques in graphs with bounded odd circumference
Nika Salia , Pósa-type results for Berge-hypergraphs
Ervin Győri, Nika Salia , Linear three-uniform hypergraphs with no Berge path of given length
Yanni Dong, Stijn Cambie , On the main distance-based entropies: the eccentricity- and Wiener-entropy
Stijn Cambie , Stephan Wagner, The minimum number of maximal independent sets in twin-free graphs
Stijn Cambie , Nika Salia , Set systems without a simplex, Helly hypergraphs and union-efficient families
Zequn Lv, Ervin Győri, Zhen He, Nika Salia , Casey Tompkins, Kitti Varga, Xiutao Zhu, Generalized Turán number for the edge blow-up graph
Xiutao Zhu, Ervin Győri, Zhen He, Zequn Lv, Nika Salia , Casey Tompkins, Kitti Varga, Edges not covered by monochromatic bipartite graphs
Jun Gao , Binlong Li, Jie Ma, Tianying Xie, On two cycles of consecutive even lengths
Zixiang Xu , Chi Hoi Yip, Sperner systems with restricted differences
Jang Soo Kim, Joonkyung Lee , Extended commonality of paths and cycles via Schur convexity
Stijn Cambie , Bradley McCoy, Gunjan Sharma, Stephan Wagner, Corrine Yap, Trees maximizing the number of almost-perfect matchings
Stijn Cambie , The average solution of a TSP instance in a graph
Jungho Ahn, Seonghyuk Im , Sang-il Oum, The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs
Stijn Cambie , Extremal and monotone behaviour of the Sudoku number and related critical set parameters
Xinbu Cheng, Zixiang Xu , Local rainbow colorings for various graphs
Zixiang Xu , Chi Hoi Yip, Intersective sets over abelian groups .
Stijn Cambie , Yanni Dong, Matteo Mazzamurro, Extremal values of degree-based entropies of bipartite graphs
To appear
Dong Yeap Kang , Tom Kelly, Daniela Kühn, Deryk Osthus, Vincent Pfenninger, Perfect matchings in random sparsifications of Dirac hypergraphs
Irene Gil Fernández , Jaehoon Kim, Hong Liu , Oleg Pikhurko, New lower bounds on kissing numbers and spherical codes in high dimensions
Stijn Cambie , Wouter Cames van Batenburg, Ewan Davies, Ross J. Kang, Packing list-colourings
Stijn Cambie , Jaehoon Kim, Hong Liu , Tuan Tran, A proof of Frankl’s conjecture on cross-union families
Jun Gao , Oliver Janzer, Hong Liu , Zixiang Xu , Extremal number of graphs from geometric shapes
Xiutao Zhu, Ervin Győri, Zhen He, Zequn Lv, Nika Salia , Chuanqi Xiao, Stability version of Dirac’s theorem and its applications for generalized Turán problems
Suyun Jiang , Hong Liu , Nika Salia , How connectivity affects the extremal number of trees
Stijn Cambie , Jun Gao , Hong Liu , Many Hamiltonian subsets in large graphs with given density
Jaehoon Kim, Hong Liu , Tuan Tran, Exponential decay of intersection volume with applications on list-decodability and Gilbert-Varshamov type bound
Hong Liu , Péter Pál Pach, Csaba Sándor, Polynomial Schur’s Theorem
Jaehoon Kim, Joonkyung Lee , Hong Liu , Tuan Tran, Rainbow cycles in properly edge-colored graphs
Jun Gao , Jie Ma, Tight bounds towards a conjecture of Gallai
Hong Liu , Richard Montgomery, A solution to Erdős and Hajnal’s odd cycle problem
Joonkyung Lee , Shoham Letzter, Alexey Pokrvoskiy, Chi-boundedness of graphs containing no cycles with $k$ chords
Seonghyuk Im , Jaehoon Kim, Joonkyung Lee , Abhishek Methuku, A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
Sejin Ko, Joonkyung Lee , Common graphs with arbitrary connectivity and chromatic number
Seonghyuk Im , Jaehoon Kim, Younjin Kim, Hong Liu , Crux, space constraints and subdivisions
Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, Hong Liu , Fractional Helly theorem for Cartesian products of convex sets
Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee , Hong Liu , and Jaehyeon Seo , On a rainbow extremal problem for color-critical graphs
2024
Minho Cho , Andreas F. Holmsen, Jinha Kim, Minki Kim, Strong Erdős-Hajnal Properties in Chordal Graphs
Zichao Dong , Zijian Xu, Rainbow Even Cycles
Minho Cho , Jinha Kim, Transversal numbers of stacked spheres
Min Xu, Zixiang Xu , Gennian Ge, Min-Qian Liu, A Rainbow Framework for Coded Caching and Its Applications
2023
Andrzej Grzesik, Ervin Győri, Nika Salia , Casey Tompkins, Subgraph densities in $K_r$-free graphs
Stijn Cambie , Maximum size of digraphs of given radius
James Tuite, Grahame Erskine, Nika Salia , Turán Problems for k-Geodetic Digraphs
Jun Gao , Hong Liu , Zixiang Xu , Stability through non-shadows
Ervin Győri, Nika Salia , Casey Tompkins, Oscar Zamora, Turán numbers of Berge trees
Stijn Cambie , Matteo Mazzamurro, Resolution of Yan’s Conjecture on Entropy of Graphs
Stijn Cambie , Michiel de Bondt, Henk Don, Extremal Binary PFAs with Small Number of States
John Haslegrave, Joseph Hyde, Jaehoon Kim, Hong Liu , Ramsey numbers of cycles versus general graphs
Hong Liu , Guanghui Wang, Laurence Wilkes, Donglei Yang, Shape of the asymptotic maximum sum-free sets in integer lattice grids
Irene Gil Fernández, Joseph Hyde, Hong Liu , Oleg Pikhurko, Zhuo Wu, Disjoint isomorphic balanced clique subdivisions
Irene Gil Fernández, Hong Liu , How to build a pillar: a proof of Thomassen’s conjecture
2022
John Haslegrave, Jie Hu, Jaehoon Kim, Hong Liu , Bingyu Luan, Guanghui Wang, Crux and long cycles in graphs
Hong Liu , Guanghui Wang, Donglei Yang, Clique immersion in graphs without fixed bipartite graph
Stijn Cambie , Rémi de Joannis de Verclos, Ross J. Kang, Regular Turán numbers and some Gan–Loh–Sudakov-type problems
Stijn Cambie , John Haslegrave, On the relationship between variable Wiener index and variable Szeged index
Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, Hong Liu , Well-mixing vertices and almost expanders
