Person:326972: Difference between revisions

From MaRDI portal
Person:326972
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Yue Jian Peng to Yue Jian Peng: Duplicate
 
(No difference)

Latest revision as of 10:54, 9 December 2023

Available identifiers

zbMath Open peng.yuejianMaRDI QIDQ326972

List of research outcomes





PublicationDate of PublicationType
On generalized Turán numbers of intersecting cliques2025-01-13Paper
Non-empty pairwise cross-intersecting families2024-12-23Paper
Lagrangian densities of 4-uniform matchings and degree stability of extremal hypergraphs2024-11-09Paper
Ramsey numbers of multiple copies of graphs in a component2024-10-09Paper
Saturation numbers of joins of graphs2024-09-26Paper
Ramsey numbers of trees versus multiple copies of books2024-07-02Paper
A spectral Erdős-Rademacher theorem2024-06-28Paper
Minimum degree stability of \({C}_{2k+1}\)-free graphs2024-04-29Paper
Multicolored Bipartite Ramsey Numbers of Large Cycles2024-04-22Paper
Bipartite Ramsey numbers of cycles2024-03-26Paper
A spectral extremal problem on non-bipartite triangle-free graphs2024-03-19Paper
Lagrangian densities of linear forests and Turán numbers of their extensions2024-01-29Paper
Lagrangian-perfect hypergraphs2023-11-06Paper
Refinement on Spectral Turán’s Theorem2023-10-26Paper
Mixed pairwise cross intersecting families (I)2023-10-26Paper
Stability of intersecting families2023-10-25Paper
Tree embeddings and tree‐star Ramsey numbers2023-10-05Paper
Spectral extremal graphs for the bowtie2023-10-04Paper
Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian2023-08-10Paper
A large tree is \(tK_m\)-good2023-05-31Paper
Degree stability of graphs forbidding odd cycles2023-05-04Paper
Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree2023-04-17Paper
An Oppenheim type inequality for positive definite block matrices2023-04-13Paper
The Lagrangian density of the disjoint union of a \(3\)-uniform tight path and a matching and the Turán number of its extension2023-04-05Paper
The Ramsey number for a forest versus disjoint union of complete graphs2023-03-09Paper
The maximum spectral radius of non-bipartite graphs forbidding short odd cycles2022-11-08Paper
Non-jumping Turán densities of hypergraphs2022-11-02Paper
Lagrangian densities of some $3$-uniform hypergraphs2022-09-27Paper
Maximisers of the hypergraph Lagrangian outside the principal range2022-08-26Paper
The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex2022-06-03Paper
The spectral radius of graphs with no intersecting odd cycles2022-05-27Paper
An Irrational Lagrangian Density of a Single Hypergraph2022-04-01Paper
Three‐colored asymmetric bipartite Ramsey number of connected matchings and cycles2022-03-31Paper
Ramsey number of multiple copies of stars2022-03-14Paper
New proofs of stability theorems on spectral graph problems2022-03-07Paper
The Ramsey Number for a Forest versus Disjoint Union of Complete Graphs2022-01-13Paper
The bipartite Ramsey number $br(C_{2n}, C_{2m})$2021-12-30Paper
Connection between continuous optimization and Turán densities of non-uniform hypergraphs2021-11-04Paper
Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions2021-08-12Paper
The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension2021-07-21Paper
https://portal.mardi4nfdi.de/entity/Q49981612021-07-01Paper
Lagrangian densities of enlargements of matchings in hypergraphs2020-02-12Paper
GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS2019-11-08Paper
\(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles2019-06-18Paper
Maximum cliques of hypergraphs and polynomial optimization2018-11-07Paper
Lagrangian densities of hypergraph cycles2018-10-30Paper
Bipartite Ramsey numbers of large cycles2018-08-30Paper
Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions2018-08-24Paper
Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs2018-07-27Paper
On Lagrangians of $3$-uniform hypergraphs2018-06-28Paper
A note on non-jumping numbers for \(r\)-uniform hypergraphs2018-06-07Paper
Dense 3-uniform hypergraphs containing a large clique2018-04-11Paper
Two extremal problems related to orders2018-03-01Paper
On Motzkin-Straus type results for non-uniform hypergraphs2017-10-17Paper
The Hessian matrix of Lagrange function2017-09-07Paper
The connection between polynomial optimization, maximum cliques and Turán densities2017-05-12Paper
A note on generalized Lagrangians of non-uniform hypergraphs2017-04-20Paper
On a conjecture of Hefetz and Keevash on Lagrangians of intersecting hypergraphs and Tur\'an numbers2017-01-22Paper
On graph-Lagrangians and clique numbers of 3-uniform hypergraphs2016-10-13Paper
https://portal.mardi4nfdi.de/entity/Q28232152016-10-06Paper
Turan numbers of extensions of some sparse hypergraphs via Lagrangians2016-09-28Paper
https://portal.mardi4nfdi.de/entity/Q29907532016-08-10Paper
Connection between the clique number and the Lagrangian of 3-uniform hypergraphs2016-05-03Paper
On Frankl and Füredi's conjecture for 3-uniform hypergraphs2016-04-21Paper
Some Motzkin-Straus type results for non-uniform hypergraphs2016-02-23Paper
Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs2016-02-23Paper
An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications2016-01-21Paper
On Lagrangians of \(r\)-uniform hypergraphs2015-09-28Paper
On graph-Lagrangians of hypergraphs containing dense subgraphs2014-11-03Paper
On the largest graph-Lagrangian of 3-graphs with fixed number of edges2014-11-03Paper
Some results on Lagrangians of hypergraphs2014-02-18Paper
On hypergraph cliques and polynomial programming2013-12-25Paper
On Motzkin-Straus Type of Results and Frankl-F\"uredi Conjecture for Hypergraphs2013-12-10Paper
On the largest graph-Lagrangians of hypergraphs2013-11-05Paper
A Motzkin-Straus type result for 3-uniform hypergraphs2013-06-26Paper
The feasible matching problem2013-06-26Paper
An extremal problern for set families generated with the union and symmetric difference operations2013-06-25Paper
On Zumkeller numbers2013-02-21Paper
On Cliques and Lagrangians of 3-uniform Hypergraphs2012-11-27Paper
On jumping densities of hypergraphs2010-05-05Paper
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles2010-04-23Paper
On substructure densities of hypergraphs2010-01-18Paper
On non-strong jumping numbers and density structures of hypergraphs2009-12-09Paper
Using Lagrangians of hypergraphs to find non-jumping numbers. I2009-06-08Paper
Generating non-jumping numbers recursively2008-09-10Paper
A note on the structure of Turán densities of hypergraphs2008-08-20Paper
https://portal.mardi4nfdi.de/entity/Q35171532008-08-12Paper
Subgraph densities in hypergraphs2008-02-22Paper
Characterization of \(P_{6}\)-free graphs2007-05-30Paper
Using Lagrangians of hypergraphs to find non-jumping numbers. II.2007-05-11Paper
Non-jumping numbers for 4-uniform hypergraphs2007-04-26Paper
A note on the jumping constant conjecture of Erdős2007-02-13Paper
Generalized \(k\)-multiway cut problems2006-09-22Paper
The Ramsey number for hypergraph cycles. I.2006-03-16Paper
https://portal.mardi4nfdi.de/entity/Q57089972005-11-21Paper
Counting Small Cliques in 3-uniform Hypergraphs2005-06-07Paper
Holes in graphs2002-02-07Paper
https://portal.mardi4nfdi.de/entity/Q48675871996-06-19Paper
https://portal.mardi4nfdi.de/entity/Q43117661994-10-30Paper
https://portal.mardi4nfdi.de/entity/Q40161311992-12-15Paper
Non-empty pairwise cross-intersecting familiesN/APaper
Spectral extremal graphs for fan graphsN/APaper

Research outcomes over time

This page was built for person: Yue Jian Peng