Yuejian Peng

activity

20092023

most citedThe spectral radius of graphs with no intersecting odd cycles

44 citations · 172 across the 37 of their papers we have counts for

collaborators

Showing 2021Show all

7 papers · 1 filter

math.CO2021

Tree Embeddings and Tree-Star Ramsey Numbers

Zilong Yan, Yuejian Peng

We say that a graph $F$ can be embedded into a graph $G$ if $G$ contains an isomorphic copy of $F$ as a subgraph. Guo and Volkmann \cite{GV} conjectured that if $G$ is a connected…

math.CO2021

Non-jumping Turán densities of hypergraphs

Zilong Yan, Yuejian Peng

A real number $α \in [0, 1)$ is a jump for an integer $r \geq 2$ if there exists $c > 0$ such that no number in $(α, α + c)$ can be the Turán density of a family of $r$ -uniform graphs. A…

math.CO2021

An irrational Lagrangian density of a single hypergraph

Zilong Yan, Yuejian Peng

The {\em Turán number} of an $r$ -uniform graph $F$ , denoted by $e x (n, F)$ , is the maximum number of edges in an $F$ -free $r$ -uniform graph on $n$ vertices. The {\em Turán density} o…

math.CO2021

The bipartite Ramsey number $b r (C_{2 n}, C_{2 m})$

Zilong Yan, Yuejian Peng

Given bipartite graphs $H_{1}$ , \dots , $H_{k}$ , the bipartite Ramsey number $b r (H_{1}, \dots, H_{k})$ is the minimum integer $N$ such that any $k$ -edge-coloring of complete bipartite graph…

math.FA2021★ 1 cited

An Oppenheim type inequality for positive definite block matrices

Yongtao Li, Yuejian Peng

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 Op…

math.CO2021★ 1 cited

Sufficient spectral conditions for graphs being $k$ -edge-Hamiltonian or $k$ -Hamiltonian

Yongtao Li, Yuejian Peng

A graph $G$ is $k$ -edge-Hamiltonian if any collection of vertex-disjoint paths with at most $k$ edges altogether belong to a Hamiltonian cycle in $G$ . A graph $G$ is $k$ -Hamiltonia…

math.CO2021★ 44 cited

The spectral radius of graphs with no intersecting odd cycles

Yongtao Li, Yuejian Peng

Let $H_{s, t_{1}, \dots, t_{k}}$ be the graph with $s$ triangles and $k$ odd cycles of lengths $t_{1}, \dots, t_{k} \geq 5$ intersecting in exactly one common vertex. Recently, Hou, Qiu and L…

Tree Embeddings and Tree-Star Ramsey Numbers

Non-jumping Turán densities of hypergraphs

An irrational Lagrangian density of a single hypergraph

The bipartite Ramsey number br(C2n​,C2m​)

An Oppenheim type inequality for positive definite block matrices

Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian

The spectral radius of graphs with no intersecting odd cycles

The bipartite Ramsey number $b r (C_{2 n}, C_{2 m})$

Sufficient spectral conditions for graphs being $k$ -edge-Hamiltonian or $k$ -Hamiltonian