Yue Ma

activity

20182026

K_{4}^{-}

-saturated graphs

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

collaborators

16 papers

math.CO2026

An improvement bound on a problem of Picasarri-Arrieta and Rambaud

Bin Chen, Xinmin Hou, Yue Ma +2

Let $k$ and $ℓ$ be positive integers. A cycle with two blocks $C (k, ℓ)$ is a digraph consisting of two internally vertex disjoint directed paths of lengths $k$ and $ℓ$ with…

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

math.CO2022

The degree and codegree threshold for linear triangle covering in 3-graphs

Yuxuan Tang, Yue Ma, Xinmin Hou

Given two $k$ -uniform hypergraphs $F$ and $G$ , we say that $G$ has an $F$ -covering if every vertex in $G$ is contained in a copy of $F$ . For $1 \leq i \leq k - 1$ , let $c_{i} (n, F)$ be the…

math.CO2021

Rainbow independent sets in graphs with maximum degree two

Yue Ma, Xinmin Hou, Jun Gao +2

Given a graph $G$ , let $f_{G} (n, m)$ be the minimal number $k$ such that every $k$ independent $n$ -sets in $G$ have a rainbow $m$ -set. Let $D (2)$ be the family of all grap…

math.CO2020★ 1 cited

The Turán number for the edge blow-up of trees

Anyao Wang, Xinmin Hou, Boyuan Liu +1

The edge blow-up of a graph $F$ is the graph obtained from replacing each edge in $F$ by a clique of the same size where the new vertices of the cliques are all different. In this…

math.CO2020★ 1 cited

A Dirac-type theorem for uniform hypergraphs

Yue Ma, Xinmin Hou, Jun Gao

Dirac (1952) proved that every connected graph of order $n > 2 k + 1$ with minimum degree more than $k$ contains a path of length at least $2 k + 1$ . Erdős and Gallai (1959) showed that ev…

math.CO2020★ 1 cited

Maximizing the number of independent sets of fixed size in $K_{n}$ -covered graphs

Anyao Wang, Xinmin Hou, Boyuan Liu +1

A graph $G$ is $H$ -covered by some given graph $H$ if each vertex in $G$ is contained in a copy of $H$ . In this note, we give the maximum number of independent sets of size $t\ge 3…

math.CO2020

Exact minimum codegree thresholds for $K_{4}^{-}$ -covering and $K_{5}^{-}$ -covering

Lei Yu, Xinmin Hou, Boyuan Liu +1

Given two $3$ -graphs $F$ and $H$ , an $F$ -covering of $H$ is a collection of copies of $F$ in $H$ such that each vertex of $H$ is contained in at least one copy of them. Let {$c_2(n…

math.CO2020

Minimizing the number of edges in $C_{\geq r}$ -saturated graphs

Yue Ma, Xinmin Hou, Doudou Hei +1

Given a family of graphs $F$ , a graph $G$ is said to be $F$ -saturated if $G$ does not contain a copy of $F$ as a subgraph for any $F \in F$ but the addi…

math.RA2019

3-Lie algebra $A_{ω}^{δ}$ -modules and induced modules

Ruipu Bai, Yue Ma, Pei Liu

In this paper, we define the induced modules of Lie algebra ad $(B)$ associated with a 3-Lie algebra $B$ -module, and study the relation between 3-Lie algebra $A_{ω}^{δ}$ -modules and ind…

math.CO2019★ 1 cited

Minimum degree of 3-graphs without long linear paths

Yue Ma, Xinmin Hou, Jun Gao

A well known theorem in graph theory states that every graph $G$ on $n$ vertices and minimum degree at least $d$ contains a path of length at least $d$ , and if $G$ is connected and…

math.CO2018★ 1 cited

Codegree conditions for tilling balanced complete $3$ -partite $3$ -graphs and generalized 4-cycles

Xinmin Hou, Boyuan Liu, Yue Ma

Given two $k$ -graphs $F$ and $H$ , a perfect $F$ -tiling (also called an $F$ -factor) in $H$ is a set of vertex disjoint copies of $F$ that together cover the vertex set of $H$ . Let $…

math.CO2018★ 5 cited

The edge spectrum of $K_{4}^{-}$ -saturated graphs

Jun Gao, Xinmin Hou, Yue Ma

Given graphs $G$ and $H$ , $G$ is $H$ -saturated if $G$ does not contain a copy of $H$ but the addition of any edge $e \in / E (G)$ creates at least one copy of $H$ within $G$ . The ed…

An improvement bound on a problem of Picasarri-Arrieta and Rambaud

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 and codegree threshold for linear triangle covering in 3-graphs

Rainbow independent sets in graphs with maximum degree two

The Turán number for the edge blow-up of trees

A Dirac-type theorem for uniform hypergraphs

Maximizing the number of independent sets of fixed size in Kn​-covered graphs

Exact minimum codegree thresholds for K4−​-covering and K5−​-covering

Minimizing the number of edges in C≥r​-saturated graphs

3-Lie algebra Aωδ​-modules and induced modules

Minimum degree of 3-graphs without long linear paths

Codegree conditions for tilling balanced complete 3-partite 3-graphs and generalized 4-cycles

The edge spectrum of K4−​-saturated graphs

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

Maximizing the number of independent sets of fixed size in $K_{n}$ -covered graphs

Exact minimum codegree thresholds for $K_{4}^{-}$ -covering and $K_{5}^{-}$ -covering

Minimizing the number of edges in $C_{\geq r}$ -saturated graphs

3-Lie algebra $A_{ω}^{δ}$ -modules and induced modules

Codegree conditions for tilling balanced complete $3$ -partite $3$ -graphs and generalized 4-cycles

The edge spectrum of $K_{4}^{-}$ -saturated graphs