Yue Ma

activity

20182026

K_{4}^{-}

-saturated graphs

5 citations · 10 across the 16 of their papers we have counts for

collaborators

Showing 2023Show all

4 papers · 1 filter

math.CO2023

The degree threshold for covering with all the connected $3$ -graphs with $3$ edges

Yue Ma, Xinmin Hou, Zhi Yin

Given two $r$ -uniform hypergraphs $F$ and $H$ , we say that $H$ has an $F$ -covering if every vertex in $H$ is contained in a copy of $F$ . Let $c_{i} (n, F)$ be the least integer such…

math.CO2023

Graphs without rainbow cliques of orders four and five

Yue Ma, Xinmin Hou

Let $G_{n}^{k} = {G_{1}, G_{2}, \dots, G_{k}}$ be a multiset of graphs on vertex set $[n]$ and let $F$ be a fixed graph with edge set $F = {e_{1}, e_{2}, \dots, e_{m}}$ and $k \geq m$ . We sa…

math.CO2023

Spectral extrema of graphs with bounded clique number and matching number

Hongyu Wang, Xinmin Hou, Yue Ma

For a set of graphs $F$ , let $\ex(n,\mathcal{F})$ and $\spex(n,\mathcal{F})$ denote the maximum number of edges and the maximum spectral radius of an $n$ -vertex $\mathcal…

math.CO2023

Generalized Turán problem with bounded matching number

Yue Ma, Xinmin Hou

For a graph $T$ and a set of graphs $H$ , let $\mbox{ex}(n,T,\mathcal{H})$ denote the maximum number of copies of $T$ in an $n$ -vertex $H$ -free graph. Recently,…

The degree threshold for covering with all the connected 3-graphs with 3 edges

Graphs without rainbow cliques of orders four and five

Spectral extrema of graphs with bounded clique number and matching number

Generalized Turán problem with bounded matching number

The degree threshold for covering with all the connected $3$ -graphs with $3$ edges