5 citations · 10 across the 16 of their papers we have counts for
5 papers · 1 filter
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 is the graph obtained from replacing each edge in by a clique of the same size where the new vertices of the cliques are all different. In this…
A Dirac-type theorem for uniform hypergraphs
Yue Ma, Xinmin Hou, Jun Gao
Dirac (1952) proved that every connected graph of order with minimum degree more than contains a path of length at least . Erdős and Gallai (1959) showed that ev…
Maximizing the number of independent sets of fixed size in -covered graphs
Anyao Wang, Xinmin Hou, Boyuan Liu +1
A graph is -covered by some given graph if each vertex in is contained in a copy of . In this note, we give the maximum number of independent sets of size $t\ge 3…
Exact minimum codegree thresholds for -covering and -covering
Lei Yu, Xinmin Hou, Boyuan Liu +1
Given two -graphs and , an -covering of is a collection of copies of in such that each vertex of is contained in at least one copy of them. Let {$c_2(n…
Minimizing the number of edges in -saturated graphs
Yue Ma, Xinmin Hou, Doudou Hei +1
Given a family of graphs , a graph is said to be -saturated if does not contain a copy of as a subgraph for any but the addi…