# Yuejian Peng

According to our database

Collaborative distances:

^{1}, Yuejian Peng authored at least 35 papers between 2002 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

λ-perfect hypergraphs and Lagrangian densities of hypergraph cycles.

Discrete Mathematics, 2019

2018

Connection Between Polynomial Optimization and Maximum Cliques of Non-Uniform Hypergraphs.

Order, 2018

Two extremal problems related to orders.

J. Comb. Optim., 2018

A Note on Non-jumping Numbers for r-Uniform Hypergraphs.

Graphs and Combinatorics, 2018

Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions.

Eur. J. Comb., 2018

2017

A Note on Generalized Lagrangians of Non-uniform Hypergraphs.

Order, 2017

On Motzkin-Straus type results for non-uniform hypergraphs.

J. Comb. Optim., 2017

The connection between polynomial optimization, maximum cliques and Turán densities.

Discrete Applied Mathematics, 2017

2016

Connection between the clique number and the Lagrangian of 3-uniform hypergraphs.

Optimization Letters, 2016

Some Motzkin-Straus type results for non-uniform hypergraphs.

J. Comb. Optim., 2016

Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs.

J. Comb. Optim., 2016

An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications.

Discrete Applied Mathematics, 2016

2015

On Lagrangians of r-uniform hypergraphs.

J. Comb. Optim., 2015

On Finding Lagrangians of 3-uniform Hypergraphs.

Ars Comb., 2015

2014

On Graph-Lagrangians of Hypergraphs Containing Dense Subgraphs.

J. Optimization Theory and Applications, 2014

On the Largest Graph-Lagrangian of 3-Graphs with Fixed Number of Edges.

J. Optimization Theory and Applications, 2014

Some results on Lagrangians of hypergraphs.

Discrete Applied Mathematics, 2014

2013

A Motzkin-Straus Type Result for 3-Uniform Hypergraphs.

Graphs and Combinatorics, 2013

The Feasible Matching Problem.

Graphs and Combinatorics, 2013

2009

On Jumping Densities of Hypergraphs.

Graphs and Combinatorics, 2009

On Substructure Densities of Hypergraphs.

Graphs and Combinatorics, 2009

On non-strong jumping numbers and density structures of hypergraphs.

Discrete Mathematics, 2009

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.

Combinatorics, Probability & Computing, 2009

2008

A note on the Structure of Turán Densities of Hypergraphs.

Graphs and Combinatorics, 2008

Generating non-jumping numbers recursively.

Discrete Applied Mathematics, 2008

A note on non-jumping numbers.

Australasian J. Combinatorics, 2008

2007

A note on the jumping constant conjecture of Erdös.

J. Comb. Theory, Ser. B, 2007

Non-Jumping Numbers for 4-Uniform Hypergraphs.

Graphs and Combinatorics, 2007

Subgraph densities in hypergraphs.

Discussiones Mathematicae Graph Theory, 2007

Using Lagrangians of hypergraphs to find non-jumping numbers(II).

Discrete Mathematics, 2007

Characterization of P

_{6}-free graphs.
Discrete Applied Mathematics, 2007

2006

The Ramsey number for hypergraph cycles I.

J. Comb. Theory, Ser. A, 2006

2005

Counting Small Cliques in 3-uniform Hypergraphs.

Combinatorics, Probability & Computing, 2005

On incomparable and uncomplemented families of sets.

Australasian J. Combinatorics, 2005

2002

Holes in Graphs.

Electr. J. Comb., 2002