11 papers · 1 filter
On the chromatic profile for tripartite graphs and beyond
Bo Ning, Jian Wang, Yisai Xue
Let be a graph and let denote the infimum of such that every -free graph with minimum degree at least is -colorable. The \textit{chromatic profile} of…
Nearly Erdős-Ko-Rado theorems
Gyula O. H. Katona, Jian Wang
If a family of -element subsets of an -element set is pairwise intersecting, then holds by the celebrated Erdős-…
Andr{á}sfai--Erdős--Sós theorem under max-degree constraints
Xizhi Liu, Sijie Ren, Jian Wang
We establish the following strengthening of the celebrated Andr{á}sfai--Erdős--Sós theorem: If is an -vertex -free graph whose minimum degree and maximum deg…
Hypergraph Turán problem of the generalized triangle with bounded matching number
Jian Wang, Wenbin Wang, Weihua Yang
Let be a 3-graph on vertices. The matching number is defined as the maximum number of disjoint edges in . The generalized triangle $…
Largest -uniform set systems with VC-dimension
Jian Wang, Zixiang Xu, Shengtong Zhang
We determine the largest size of -uniform set systems on with VC-dimension for all .
Gallai-Schur Triples and Related Problems
Yaping Mao, Aaron Robertson, Jian Wang +2
Schur's Theorem states that, for any , there exists a minimum integer such that every -coloring of admits a monochromatic solutio…