Jian Wang

Orcid: 0000-0001-7716-5485

Affiliations:

Taiyuan University of Technology, Department of Mathematics, Taiyuan, China
Nankai University, Center for Combinatorics, Tianjin, China (2013 - 2016)

According to our database¹, Jian Wang authored at least 23 papers between 2009 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Families with restricted matching number and multiply covered shadows.

[BibT_eX]

[DOI]

Discret. Math., March, 2024

Four-vertex traces of finite sets.

[BibT_eX]

[DOI]

Peter Frankl

Jian Wang

Graphs Comb., February, 2024

Non-trivial t-intersecting separated families.

[BibT_eX]

[DOI]

Discret. Appl. Math., January, 2024

Intersecting families without unique shadow.

[BibT_eX]

[DOI]

Peter Frankl

Jian Wang

Comb. Probab. Comput., January, 2024

2023

Some inequalities concerning cross-intersecting families of integer sequences.

[BibT_eX]

[DOI]

Discret. Math., December, 2023

A product version of the Hilton-Milner theorem.

[BibT_eX]

[DOI]

Peter Frankl

Jian Wang

J. Comb. Theory A, November, 2023

Extremal Problem for Matchings and Rainbow Matchings on Direct Products.

[BibT_eX]

[DOI]

Jian Wang

Jie You

SIAM J. Discret. Math., September, 2023

Intersections and distinct intersections in cross-intersecting families.

[BibT_eX]

[DOI]

Peter Frankl

Jian Wang

Eur. J. Comb., May, 2023

A note on minimum degree condition for Hamilton (a, b)-cycles in hypergraphs.

[BibT_eX]

[DOI]

Jian Wang

Discret. Math., 2023

2022

A stability theorem for maximal C 2 k + 1 ${C}_{2k+1}$ -free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

On the maximum number of edges in hypergraphs with fixed matching and clique number.

[BibT_eX]

[DOI]

Peter Frankl

Erica L. L. Liu

Jian Wang

Eur. J. Comb., 2022

On the sum of sizes of overlapping families.

[BibT_eX]

[DOI]

Peter Frankl

Jian Wang

Discret. Math., 2022

2020

The shifting method and generalized Turán number of matchings.

[BibT_eX]

[DOI]

Jian Wang

Eur. J. Comb., 2020

The formula for Turán number of spanning linear forests.

[BibT_eX]

[DOI]

Bo Ning

Jian Wang

Discret. Math., 2020

Turán problems for vertex-disjoint cliques in multi-partite hypergraphs.

[BibT_eX]

[DOI]

Erica L. L. Liu

Jian Wang

Discret. Math., 2020

Maximizing the number of cliques in graphs with given matching number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

The Maximum Number of Cliques in Hypergraphs without Large Matchings.

[BibT_eX]

[DOI]

Erica L. L. Liu

Jian Wang

Electron. J. Comb., 2020

2019

The Turán number for spanning linear forests.

[BibT_eX]

[DOI]

Jian Wang

Weihua Yang

Discret. Appl. Math., 2019

2018

Approximation Algorithms for Protein Folding in the Hydrophobic-Polar Model on 3D Hexagonal Prism Lattice.

[BibT_eX]

[DOI]

Qiang-Hui Guo

Jian Wang

Zhao Xu

J. Comput. Biol., 2018

2016

Enumeration of Extended m-Regular Linear Stacks.

[BibT_eX]

[DOI]

Qiang-Hui Guo

Lisa Hui Sun

Jian Wang

J. Comput. Biol., 2016

People counting with block histogram features and network flow constraints.

[BibT_eX]

[DOI]

Liqing Gao

Yanzhang Wang

Jian Wang

Proceedings of the 9th International Congress on Image and Signal Processing, 2016

2014

Zigzag Stacks and m-Regular Linear Stacks.

[BibT_eX]

[DOI]

J. Comput. Biol., 2014

2009

Hamilton circles in infinite planar graphs.

[BibT_eX]

[DOI]

Qing Cui

Jian Wang

Xingxing Yu

J. Comb. Theory B, 2009

Jian Wang

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...