Yuejian Peng

Orcid: 0000-0002-0243-0691

According to our database1, Yuejian Peng authored at least 53 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Stability of intersecting families.
Eur. J. Comb., January, 2024

A Spectral Extremal Problem on Non-Bipartite Triangle-Free Graphs.
Electron. J. Comb., 2024

A spectral Erdős-Rademacher theorem.
Adv. Appl. Math., 2024

Refinement on Spectral Turán's Theorem.
SIAM J. Discret. Math., December, 2023

Spectral extremal graphs for the bowtie.
Discret. Math., December, 2023

A large tree is <i>tK</i><sub><i>m</i></sub>-good.
Discret. Math., August, 2023

The Ramsey Number for a Forest Versus Disjoint Union of Complete Graphs.
Graphs Comb., April, 2023

Non-jumping Turán densities of hypergraphs.
Discret. Math., 2023

An Irrational Lagrangian Density of a Single Hypergraph.
SIAM J. Discret. Math., 2022

Tree embeddings and tree-star Ramsey numbers.
J. Graph Theory, 2022

Ramsey number of multiple copies of stars.
Discret. Math., 2022

The spectral radius of graphs with no intersecting odd cycles.
Discret. Math., 2022

The Maximum Spectral Radius of Non-Bipartite Graphs Forbidding Short Odd Cycles.
Electron. J. Comb., 2022

Maximisers of the hypergraph Lagrangian outside the principal range.
Appl. Math. Comput., 2022

Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions.
Graphs Comb., 2021

The Lagrangian density of<i>{123, 234, 456}</i> and the Turán number of its extension.
Discuss. Math. Graph Theory, 2021

Three-colored asymmetric bipartite Ramsey number of connected matchings and cycles.
J. Graph Theory, 2020

Lagrangian densities of enlargements of matchings in hypergraphs.
Appl. Math. Comput., 2020

λ-perfect hypergraphs and Lagrangian densities of hypergraph cycles.
Discret. Math., 2019

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 Comb., 2018

Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions.
Eur. J. Comb., 2018

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.
Discret. Appl. Math., 2017

Connection between the clique number and the Lagrangian of 3-uniform hypergraphs.
Optim. Lett., 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.
Discret. Appl. Math., 2016

On Lagrangians of r-uniform hypergraphs.
J. Comb. Optim., 2015

On Finding Lagrangians of 3-uniform Hypergraphs.
Ars Comb., 2015

On Graph-Lagrangians of Hypergraphs Containing Dense Subgraphs.
J. Optim. Theory Appl., 2014

On the Largest Graph-Lagrangian of 3-Graphs with Fixed Number of Edges.
J. Optim. Theory Appl., 2014

Some results on Lagrangians of hypergraphs.
Discret. Appl. Math., 2014

A Motzkin-Straus Type Result for 3-Uniform Hypergraphs.
Graphs Comb., 2013

The Feasible Matching Problem.
Graphs Comb., 2013

On Jumping Densities of Hypergraphs.
Graphs Comb., 2009

On Substructure Densities of Hypergraphs.
Graphs Comb., 2009

On non-strong jumping numbers and density structures of hypergraphs.
Discret. Math., 2009

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.
Comb. Probab. Comput., 2009

A note on the Structure of Turán Densities of Hypergraphs.
Graphs Comb., 2008

Generating non-jumping numbers recursively.
Discret. Appl. Math., 2008

A note on non-jumping numbers.
Australas. J Comb., 2008

A note on the jumping constant conjecture of Erdös.
J. Comb. Theory B, 2007

Non-Jumping Numbers for 4-Uniform Hypergraphs.
Graphs Comb., 2007

Subgraph densities in hypergraphs.
Discuss. Math. Graph Theory, 2007

Using Lagrangians of hypergraphs to find non-jumping numbers(II).
Discret. Math., 2007

Characterization of P<sub>6</sub>-free graphs.
Discret. Appl. Math., 2007

The Ramsey number for hypergraph cycles I.
J. Comb. Theory A, 2006

Counting Small Cliques in 3-uniform Hypergraphs.
Comb. Probab. Comput., 2005

On incomparable and uncomplemented families of sets.
Australas. J Comb., 2005

Holes in Graphs.
Electron. J. Comb., 2002