default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuejian Peng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j62]Zilong Yan, Yuejian Peng:
Lagrangian densities of 4-uniform matchings and degree stability of extremal hypergraphs. Discret. Math. 348(1): 114235 (2025)- [j61]Yiran Zhang, Yuejian Peng:
Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree. Discret. Math. 348(4): 114363 (2025) - [j60]Yiran Zhang, Yuejian Peng:
Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree. Discret. Math. 348(4): 114363 (2025) - [j59]Loujun Yu, Yongtao Li, Yuejian Peng:
Spectral extremal graphs for fan graphs. Discret. Math. 348(5): 114391 (2025) - [j58]Xiaoli Yuan, Yuejian Peng:
On Generalized Turán Numbers of Intersecting Cliques. Graphs Comb. 41(1): 9 (2025) - [j57]Yang Huang, Yuejian Peng:
Non-empty pairwise cross-intersecting families. J. Comb. Theory, Ser. A 211: 105981 (2025) - 2024
- [j56]Yongtao Li, Lu Lu, Yuejian Peng:
A spectral Erdős-Rademacher theorem. Adv. Appl. Math. 158: 102720 (2024) - [j55]Yongtao Li, Lihua Feng, Yuejian Peng:
A Spectral Extremal Problem on Non-Bipartite Triangle-Free Graphs. Electron. J. Comb. 31(1) (2024) - [j54]Sinan Hu, Zhidan Luo
, Yuejian Peng:
Saturation numbers of joins of graphs. Discret. Appl. Math. 357: 300-309 (2024) - [j53]Yang Huang, Yuejian Peng:
Stability of intersecting families. Eur. J. Comb. 115: 103774 (2024) - [j52]Zilong Yan, Yuejian Peng:
Bipartite Ramsey numbers of cycles. Eur. J. Comb. 118: 103921 (2024) - [j51]Caixia Huang, Yuejian Peng, Yiran Zhang:
Ramsey Numbers of Multiple Copies of Graphs in a Component. Graphs Comb. 40(5): 94 (2024) - 2023
- [j50]Zilong Yan, Yuejian Peng:
Non-jumping Turán densities of hypergraphs. Discret. Math. 346(1): 113195 (2023) - [j49]Zhidan Luo, Yuejian Peng:
A large tree is tKm-good. Discret. Math. 346(8): 113502 (2023) - [j48]Yongtao Li, Lu Lu, Yuejian Peng:
Spectral extremal graphs for the bowtie. Discret. Math. 346(12): 113680 (2023) - [j47]Sinan Hu, Yuejian Peng:
The Ramsey Number for a Forest Versus Disjoint Union of Complete Graphs. Graphs Comb. 39(2): 26 (2023) - [j46]Yongtao Li, Yuejian Peng:
Refinement on Spectral Turán's Theorem. SIAM J. Discret. Math. 37(4): 2462-2485 (2023) - 2022
- [j45]Ran Gu, Hui Lei, Yuejian Peng, Yongtang Shi:
Maximisers of the hypergraph Lagrangian outside the principal range. Appl. Math. Comput. 434: 127418 (2022) - [j44]Yongtao Li, Yuejian Peng:
The Maximum Spectral Radius of Non-Bipartite Graphs Forbidding Short Odd Cycles. Electron. J. Comb. 29(4) (2022) - [j43]Zhidan Luo, Yuejian Peng:
Ramsey number of multiple copies of stars. Discret. Math. 345(5): 112801 (2022) - [j42]Yongtao Li, Yuejian Peng:
The spectral radius of graphs with no intersecting odd cycles. Discret. Math. 345(8): 112907 (2022) - [j41]Zilong Yan, Yuejian Peng:
Tree embeddings and tree-star Ramsey numbers. J. Graph Theory 100(4): 733-745 (2022) - [j40]Zilong Yan, Yuejian Peng:
An Irrational Lagrangian Density of a Single Hypergraph. SIAM J. Discret. Math. 36(1): 786-822 (2022) - 2021
- [j39]Pingge Chen, Jinhua Liang, Yuejian Peng:
The Lagrangian density of{123, 234, 456} and the Turán number of its extension. Discuss. Math. Graph Theory 41(4): 905-921 (2021) - [j38]Biao Wu, Yuejian Peng:
Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions. Graphs Comb. 37(3): 711-729 (2021) - 2020
- [j37]Sinan Hu, Yuejian Peng:
Lagrangian densities of enlargements of matchings in hypergraphs. Appl. Math. Comput. 374: 125068 (2020) - [j36]Zhidan Luo, Yuejian Peng:
Three-colored asymmetric bipartite Ramsey number of connected matchings and cycles. J. Graph Theory 95(3): 368-383 (2020)
2010 – 2019
- 2019
- [j35]Zilong Yan, Yuejian Peng:
λ-perfect hypergraphs and Lagrangian densities of hypergraph cycles. Discret. Math. 342(7): 2048-2059 (2019) - 2018
- [j34]Tao Jiang, Yuejian Peng, Biao Wu:
Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions. Eur. J. Comb. 73: 20-36 (2018) - [j33]Shaoqiang Liu, Yuejian Peng:
A Note on Non-jumping Numbers for r-Uniform Hypergraphs. Graphs Comb. 34(3): 489-499 (2018) - [j32]Biao Wu, Yuejian Peng:
Two extremal problems related to orders. J. Comb. Optim. 35(2): 588-612 (2018) - [j31]Pingge Chen, Yuejian Peng:
Connection Between Polynomial Optimization and Maximum Cliques of Non-Uniform Hypergraphs. Order 35(2): 301-319 (2018) - 2017
- [j30]Biao Wu, Yuejian Peng:
The connection between polynomial optimization, maximum cliques and Turán densities. Discret. Appl. Math. 225: 114-121 (2017) - [j29]Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao:
On Motzkin-Straus type results for non-uniform hypergraphs. J. Comb. Optim. 34(2): 504-521 (2017) - [j28]Yuejian Peng, Biao Wu, Yuping Yao:
A Note on Generalized Lagrangians of Non-uniform Hypergraphs. Order 34(1): 9-21 (2017) - 2016
- [j27]Yuejian Peng, Hao Peng, Qingsong Tang, Cheng Zhao:
An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications. Discret. Appl. Math. 200: 170-175 (2016) - [j26]Ran Gu, Xueliang Li, Yuejian Peng, Yongtang Shi:
Some Motzkin-Straus type results for non-uniform hypergraphs. J. Comb. Optim. 31(1): 223-238 (2016) - [j25]Yanming Chang, Yuejian Peng, Yuping Yao:
Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs. J. Comb. Optim. 31(2): 881-892 (2016) - [j24]Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao:
Connection between the clique number and the Lagrangian of 3-uniform hypergraphs. Optim. Lett. 10(4): 685-697 (2016) - 2015
- [j23]George He, Yuejian Peng, Cheng Zhao:
On Finding Lagrangians of 3-uniform Hypergraphs. Ars Comb. 122: 235-256 (2015) - [j22]Yuejian Peng, Qingsong Tang, Cheng Zhao:
On Lagrangians of r-uniform hypergraphs. J. Comb. Optim. 30(3): 812-825 (2015) - 2014
- [j21]Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao:
Some results on Lagrangians of hypergraphs. Discret. Appl. Math. 166: 222-238 (2014) - [j20]Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao:
On Graph-Lagrangians of Hypergraphs Containing Dense Subgraphs. J. Optim. Theory Appl. 163(1): 31-56 (2014) - [j19]Yanping Sun, Qingsong Tang, Cheng Zhao, Yuejian Peng:
On the Largest Graph-Lagrangian of 3-Graphs with Fixed Number of Edges. J. Optim. Theory Appl. 163(1): 57-79 (2014) - 2013
- [j18]Yuejian Peng, Cheng Zhao:
A Motzkin-Straus Type Result for 3-Uniform Hypergraphs. Graphs Comb. 29(3): 681-694 (2013) - [j17]Yuejian Peng, Papa A. Sissokho:
The Feasible Matching Problem. Graphs Comb. 29(3): 695-704 (2013)
2000 – 2009
- 2009
- [j16]Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Jozef Skokan:
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. Comb. Probab. Comput. 18(1-2): 165-203 (2009) - [j15]Yuejian Peng, Cheng Zhao:
On non-strong jumping numbers and density structures of hypergraphs. Discret. Math. 309(12): 3917-3929 (2009) - [j14]Yuejian Peng:
On Substructure Densities of Hypergraphs. Graphs Comb. 25(4): 583-600 (2009) - [j13]Yuejian Peng:
On Jumping Densities of Hypergraphs. Graphs Comb. 25(5): 759-766 (2009) - 2008
- [j12]Yuejian Peng:
A note on non-jumping numbers. Australas. J Comb. 41: 3-14 (2008) - [j11]Yuejian Peng, Cheng Zhao:
Generating non-jumping numbers recursively. Discret. Appl. Math. 156(10): 1856-1864 (2008) - [j10]Yuejian Peng:
A note on the Structure of Turán Densities of Hypergraphs. Graphs Comb. 24(2): 113-125 (2008) - 2007
- [j9]Jiping Liu, Yuejian Peng, Cheng Zhao:
Characterization of P6-free graphs. Discret. Appl. Math. 155(8): 1038-1043 (2007) - [j8]Yuejian Peng:
Using Lagrangians of hypergraphs to find non-jumping numbers(II). Discret. Math. 307(14): 1754-1766 (2007) - [j7]Yuejian Peng:
Subgraph densities in hypergraphs. Discuss. Math. Graph Theory 27(2): 281-297 (2007) - [j6]Yuejian Peng:
Non-Jumping Numbers for 4-Uniform Hypergraphs. Graphs Comb. 23(1): 97-110 (2007) - [j5]Peter Frankl, Yuejian Peng, Vojtech Rödl, John M. Talbot:
A note on the jumping constant conjecture of Erdös. J. Comb. Theory B 97(2): 204-216 (2007) - 2006
- [j4]Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan:
The Ramsey number for hypergraph cycles I. J. Comb. Theory A 113(1): 67-83 (2006) - 2005
- [j3]Yuejian Peng, Cheng Zhao:
On incomparable and uncomplemented families of sets. Australas. J Comb. 33: 157-168 (2005) - [j2]Yuejian Peng, Vojtech Rödl, Jozef Skokan:
Counting Small Cliques in 3-uniform Hypergraphs. Comb. Probab. Comput. 14(3): 371-413 (2005) - 2002
- [j1]Yuejian Peng, Vojtech Rödl, Andrzej Rucinski:
Holes in Graphs. Electron. J. Comb. 9(1) (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
