Hamilton circles in infinite planar graphs. - Qing Cui; Jian Wang 092; Xingxing Yu (J. Comb. Theory B, 2009)

Zigzag Stacks and m-Regular Linear Stacks. - William Y. C. Chen; Qiang-Hui Guo; Lisa Hui Sun; Jian Wang 092 (J. Comput. Biol., 2014)

People counting with block histogram features and network flow constraints. - Liqing Gao; Yanzhang Wang; Jian Wang 092 (CISP-BMEI, 2016)

Enumeration of Extended m-Regular Linear Stacks. - Qiang-Hui Guo; Lisa Hui Sun; Jian Wang 092 (J. Comput. Biol., 2016)

Approximation Algorithms for Protein Folding in the Hydrophobic-Polar Model on 3D Hexagonal Prism Lattice. - Qiang-Hui Guo; Jian Wang 092; Zhao Xu (J. Comput. Biol., 2018)

The Turán number for spanning linear forests. - Jian Wang 092; Weihua Yang (Discret. Appl. Math., 2019)

The Maximum Number of Cliques in Hypergraphs without Large Matchings. - Erica L. L. Liu; Jian Wang 092 (Electron. J. Comb., 2020)

Maximizing the number of cliques in graphs with given matching number. - Xiuzhuan Duan; Bo Ning 001; Xing Peng; Jian Wang 092; Weihua Yang (Discret. Appl. Math., 2020)

Turán problems for vertex-disjoint cliques in multi-partite hypergraphs. - Erica L. L. Liu; Jian Wang 092 (Discret. Math., 2020)

The formula for Turán number of spanning linear forests. - Bo Ning 001; Jian Wang 092 (Discret. Math., 2020)

The shifting method and generalized Turán number of matchings. - Jian Wang 092 (Eur. J. Comb., 2020)

On the sum of sizes of overlapping families. - Peter Frankl; Jian Wang 092 (Discret. Math., 2022)

On the maximum number of edges in hypergraphs with fixed matching and clique number. - Peter Frankl; Erica L. L. Liu; Jian Wang 092 (Eur. J. Comb., 2022)

A stability theorem for maximal C 2 k + 1 ${C}_{2k+1}$ -free graphs. - Jian Wang 092; Shipeng Wang; Weihua Yang; Xiaoli Yuan (J. Graph Theory, 2022)

A note on minimum degree condition for Hamilton (a, b)-cycles in hypergraphs. - Jian Wang 092 (Discret. Math., 2023)

Intersections and distinct intersections in cross-intersecting families. - Peter Frankl; Jian Wang 092 (Eur. J. Comb., 2023)

Extremal Problem for Matchings and Rainbow Matchings on Direct Products. - Jian Wang 092; Jie You (SIAM J. Discret. Math., 2023)

A product version of the Hilton-Milner theorem. - Peter Frankl; Jian Wang 092 (J. Comb. Theory A, 2023)

Some inequalities concerning cross-intersecting families of integer sequences. - Peter Frankl; Erica L. L. Liu; Jian Wang 092; Zhe Yang (Discret. Math., 2023)

Improved Bounds Concerning the Maximum Degree of Intersecting Hypergraphs. - Peter Frankl; Jian Wang 092 (Electron. J. Comb., 2024)

Improved bounds on the maximum diversity of intersecting families. - Peter Frankl; Jian Wang 092 (Eur. J. Comb., 2024)

A Stability Result for ( boldsymbol{C}_{ boldsymbol{2k+1}} )-Free Graphs. - Sijie Ren; Jian Wang 092; Shipeng Wang; Weihua Yang (SIAM J. Discret. Math., 2024)

Intersecting families without unique shadow. - Peter Frankl; Jian Wang 092 (Comb. Probab. Comput., 2024)

Non-trivial t-intersecting separated families. - Peter Frankl; Erica L. L. Liu; Jian Wang 092; Zhe Yang (Discret. Appl. Math., 2024)

Four-vertex traces of finite sets. - Peter Frankl; Jian Wang 092 (Graphs Comb., 2024)

Families with restricted matching number and multiply covered shadows. - Peter Frankl; Baolong Shang; Jian Wang 092; Jie You (Discret. Math., 2024)

New Bounds on Families without Large Sunflowers. - Peter Frankl; Jian Wang 092 (Electron. J. Comb., 2025)

On the maximum diversity of hypergraphs with fixed matching number. - Peter Frankl; Jian Wang 092 (Discret. Appl. Math., 2025)

Intersecting families with covering number five. - Peter Frankl; Jian Wang 092 (Discret. Math., 2025)

On the C-diversity of intersecting k-graphs. - Peter Frankl; Jian Wang 092 (Eur. J. Comb., 2025)

Intersecting families with covering number three. - Peter Frankl; Jian Wang 092 (J. Comb. Theory B, 2025)