F. Tian

activity

20192022

collaborators

4 papers

math.CO2022

Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs

Lin Niu, Xiangwen Li

A {\em $(d, h)$ -decomposition} of a graph $G$ is an order pair $(D, H)$ such that $H$ is a subgraph of $G$ where $H$ has the maximum degree at most $h$ and $D$ is an acyclic orientat…

math.CO2022

Large induced distance matchings in certain sparse random graphs

Fang Tian, Yun-Qin Sun, Zi-Long Liu

For a fixed integer $k ⩾ 2$ , let $G \in G (n, p)$ be a simple connected graph on $n \to \infty$ vertices with the expected degree $d = n p$ satisfying $d\geqslant…

math.CO2021

On the number of linear multipartite hypergraphs with given size

Fang Tian

For any given integer $r ⩾ 3$ , let $k = k (n)$ be an integer with $r ⩽ k ⩽ n$ . A hypergraph is $r$ -uniform if each edge is a set of $r$ vertices, and is said to b…

math.CO2019

Asymptotic enumeration of linear hypergraphs with given number of vertices and edges

Brendan D. McKay, Fang Tian

For $n \geq 3$ , let $r = r (n) \geq 3$ be an integer. A hypergraph is $r$ -uniform if each edge is a set of $r$ vertices, and is said to be linear if two edges intersect in at most one v…