Yuejian Peng

,

Discret. Math., 2025

Ramsey Numbers of Multiple Copies of Graphs in a Component.

[BibT_eX]

[DOI]

Caixia Huang

,

,

Yiran Zhang

Graphs Comb., October, 2024

Stability of intersecting families.

[BibT_eX]

[DOI]

Yang Huang

,

Eur. J. Comb., January, 2024

Bipartite Ramsey numbers of cycles.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2024

Saturation numbers of joins of graphs.

[BibT_eX]

[DOI]

Sinan Hu

,

,

Discret. Appl. Math., 2024

A Spectral Extremal Problem on Non-Bipartite Triangle-Free Graphs.

[BibT_eX]

[DOI]

,

Lihua Feng

,

Electron. J. Comb., 2024

A spectral Erdős-Rademacher theorem.

[BibT_eX]

[DOI]

,

Lu Lu

,

Adv. Appl. Math., 2024

Refinement on Spectral Turán's Theorem.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., December, 2023

Spectral extremal graphs for the bowtie.

[BibT_eX]

[DOI]

,

Lu Lu

,

Discret. Math., December, 2023

A large tree is tKm-good.

[BibT_eX]

[DOI]

,

Discret. Math., August, 2023

The Ramsey Number for a Forest Versus Disjoint Union of Complete Graphs.

[BibT_eX]

[DOI]

Sinan Hu

,

Graphs Comb., April, 2023

Non-jumping Turán densities of hypergraphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2023

An Irrational Lagrangian Density of a Single Hypergraph.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2022

Tree embeddings and tree-star Ramsey numbers.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2022

Ramsey number of multiple copies of stars.

[BibT_eX]

[DOI]

,

Discret. Math., 2022

The spectral radius of graphs with no intersecting odd cycles.

[BibT_eX]

[DOI]

,

Discret. Math., 2022

The Maximum Spectral Radius of Non-Bipartite Graphs Forbidding Short Odd Cycles.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2022

Maximisers of the hypergraph Lagrangian outside the principal range.

[BibT_eX]

[DOI]

,

,

,

Appl. Math. Comput., 2022

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

[BibT_eX]

[DOI]

,

Graphs Comb., 2021

The Lagrangian density of{123, 234, 456} and the Turán number of its extension.

[BibT_eX]

[DOI]

Pingge Chen

,

Jinhua Liang

,

Discuss. Math. Graph Theory, 2021

Three-colored asymmetric bipartite Ramsey number of connected matchings and cycles.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2020

Lagrangian densities of enlargements of matchings in hypergraphs.

[BibT_eX]

[DOI]

Sinan Hu

,

Appl. Math. Comput., 2020

λ-perfect hypergraphs and Lagrangian densities of hypergraph cycles.

[BibT_eX]

[DOI]

,

Discret. Math., 2019

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

[BibT_eX]

[DOI]

Pingge Chen

,

Order, 2018

Two extremal problems related to orders.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2018

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

[BibT_eX]

[DOI]

Shaoqiang Liu

,

Graphs Comb., 2018

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

[BibT_eX]

[DOI]

Tao Jiang

,

,

Eur. J. Comb., 2018

A Note on Generalized Lagrangians of Non-uniform Hypergraphs.

[BibT_eX]

[DOI]

,

,

Yuping Yao

Order, 2017

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

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2017

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

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2017

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

[BibT_eX]

[DOI]

,

,

,

Optim. Lett., 2016

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

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2016

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

[BibT_eX]

[DOI]

Yanming Chang

,

,

Yuping Yao

J. Comb. Optim., 2016

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

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2016

On Lagrangians of r-uniform hypergraphs.

[BibT_eX]

[DOI]

,

Qingsong Tang

,

J. Comb. Optim., 2015

On Finding Lagrangians of 3-uniform Hypergraphs.

[BibT_eX]

George He

,

,

Ars Comb., 2015

On Graph-Lagrangians of Hypergraphs Containing Dense Subgraphs.

[BibT_eX]

[DOI]

,

,

,

J. Optim. Theory Appl., 2014

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

[BibT_eX]

[DOI]

,

,

,

J. Optim. Theory Appl., 2014

Some results on Lagrangians of hypergraphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2014

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

[BibT_eX]

[DOI]

,

Graphs Comb., 2013

The Feasible Matching Problem.

[BibT_eX]

[DOI]

,

Papa A. Sissokho

Graphs Comb., 2013

On Jumping Densities of Hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2009

On Substructure Densities of Hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2009

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

[BibT_eX]

[DOI]

,

Discret. Math., 2009

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.

[BibT_eX]

[DOI]

,

,

,

,

,

Comb. Probab. Comput., 2009

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

[BibT_eX]

[DOI]

Graphs Comb., 2008

Generating non-jumping numbers recursively.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2008

A note on non-jumping numbers.

[BibT_eX]

[DOI]

Australas. J Comb., 2008

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

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, 2007

Non-Jumping Numbers for 4-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Subgraph densities in hypergraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2007

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

[BibT_eX]

[DOI]

Discret. Math., 2007

Characterization of P6-free graphs.

[BibT_eX]

[DOI]

Jiping Liu

,

,

Discret. Appl. Math., 2007

The Ramsey number for hypergraph cycles I.

[BibT_eX]

[DOI]

,

,

,

,

,

,

J. Comb. Theory A, 2006

Counting Small Cliques in 3-uniform Hypergraphs.

[BibT_eX]

[DOI]

,

Vojtech Rödl

,

Jozef Skokan

Comb. Probab. Comput., 2005

On incomparable and uncomplemented families of sets.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2005

Holes in Graphs.

[BibT_eX]

[DOI]