Zobrazeno 1 - 10 of 61 pro vyhledávání: '"Yuejian Peng"'
1
Report
Intersecting families with full difference sets
Autor: zilong, Yan, Yuejian, Peng
For a family $\mathcal{F}$ of subsets of a finite set, define $\mathcal{D}(\mathcal{F})=\{F\setminus F': F, F'\in\mathcal{F}\}$. A family $\mathcal{F}$ is called intersecting if $F\cap F'\not=\emptyset$ for all $F, F'\in\mathcal{F}$. Frankl \cite{Fra
Externí odkaz: http://arxiv.org/abs/2410.23723
Zobrazit plný text záznamu
2
Akademický článek
REFINEMENT ON SPECTRAL TURÁN'S THEOREM.
Autor: YONGTAO LI, YUEJIAN PENG
Publikováno v: SIAM Journal on Discrete Mathematics; 2023, Vol. 37 Issue 4, p2462-2485, 24p
Zobrazit plný text záznamu
6
The Lagrangian Density of {123, 234, 456} and the Turán Number of its Extension
Autor: Yuejian Peng, Jinhua Liang, Pingge Chen
Publikováno v: Discussiones Mathematicae Graph Theory, Vol 41, Iss 4, Pp 905-921 (2021)
Given a positive integer n and an r-uniform hypergraph F, the Turán number ex(n, F ) is the maximum number of edges in an F -free r-uniform hypergraph on n vertices. The Turán density of F is defined as π(F)=limn→∞ex(n,F)(rn)\pi \left( F \righ
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ba8c5f2de8441bd67f4ca4f4a285a2c8
https://doaj.org/article/03ddcef431b14157bb3bf2fd994f6ad0
Zobrazit plný text záznamu
7
An Oppenheim type inequality for positive definite block matrices
Autor: Yuejian Peng, Yongtao Li
Publikováno v: Linear and Multilinear Algebra. 70:4455-4466
We present an Oppenheim type determinantal inequality for positive definite block matrices. Recently, Lin [Linear Algebra Appl. 452 (2014) 1--6] proved a remarkable extension of Oppenheim type inequality for block matrices, which solved a conjecture
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::43a036afdbb31aab53903ae81799bc7d
https://doi.org/10.1080/03081087.2021.1882370
Zobrazit plný text záznamu
8
Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions
Autor: Biao Wu, Yuejian Peng
Publikováno v: Graphs and Combinatorics. 37:711-729
For a fixed positive integer n and an r-uniform hypergraph H, the Turan number ex(n, H) is the maximum number of edges in an H-free r-uniform hypergraph on n vertices, and the Lagrangian density of H is defined as $$\pi _{\lambda }(H)=\sup \{r! \lamb
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::6c75c35104a875aa32d5a0064ef9f4cc
https://doi.org/10.1007/s00373-020-02270-w
Zobrazit plný text záznamu
9
The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
Autor: Yongtao Li, Yuejian Peng
It is well-known that eigenvalues of graphs can be used to describe structural properties and parameters of graphs. A theorem of Nosal states that if $G$ is a triangle-free graph with $m$ edges, then $\lambda (G)\le \sqrt{m}$, equality holds if and o
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dd4e0b5af8aa126005b63c6beb13cad8
http://arxiv.org/abs/2204.09884
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje