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 2023Show all

4 papers · 1 filter

math.CO2023★ 1 cited

Non-empty pairwise cross-intersecting families

Yang Huang, Yuejian Peng

Two families $A$ and $B$ are cross-intersecting if $A \cap B \neq = \emptyset$ for any $A \in A$ and $B \in B$ . We call $t$ families $\mathcal{A}_1…

math.CO2023★ 4 cited

Tight bound on the minimum degree to guarantee graphs forbidding some odd cycles to be bipartite

Xiaoli Yuan, Yuejian Peng

Erdős and Simonovits asked the following question: For an integer $r \geq 2$ and a family of non-bipartite graphs $H$ , determine the infimum of $α$ such that any $\mathcal…

math.CO2023★ 1 cited

Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree

Yiran Zhang, Yuejian Peng

For graphs $G_{0}$ , $G_{1}$ and $G_{2}$ , write $G_{0} ⟼ (G_{1}, G_{2})$ if each red-blue-edge-coloring of $G_{0}$ yields a red $G_{1}$ or a blue $G_{2}$ . The Ramsey number $r (G_{1}, G_{2})$ is t…

math.CO2023★ 12 cited

A spectral extremal problem on non-bipartite triangle-free graphs

Yongtao Li, Lihua Feng, Yuejian Peng

A theorem of Nosal and Nikiforov states that if $G$ is a triangle-free graph with $m$ edges, then $λ (G) \leq m$ , where the equality holds if and only if $G$ is a complete bipa…