F. Tian

activity

20192022

most citedAsymptotic enumeration of linear hypergraphs with given number of vertices and edges

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

collaborators

Showing math.COShow all

10 papers · 1 filter

math.CO2022

A note on the random triadic process

Fang Tian, Yiting Yang

For a fixed integer $r ⩾ 3$ , let $H_{r} (n, p)$ be a random $r$ -uniform hypergraph on the vertex set $[n]$ , where each $r$ -set is an edge randomly and independently wit…

math.CO2022

Every toroidal graphs without adjacent triangles is odd 8-colorable

Fangyu Tian, Yuxue Yin

Odd coloring is a proper coloring with an additional restriction that every non-isolated vertex has some color that appears an odd number of times in its neighborhood. The minimum…

math.CO2022

Every toroidal graph without $3$ -cycles is odd $7$ -colorable

Fangyu Tian, Yuxue Yin

Odd coloring is a proper coloring with an additional restriction that every non-isolated vertex has some color that appears an odd number of times in its neighborhood. The minimum…

math.CO2022

The odd chromatic number of a toroidal graph is at most 9

Fangyu Tian, Yuxue Yin

It's well known that every planar graph is $4$ -colorable. A toroidal graph is a graph that can be embedded on a torus. It's proved that every toroidal graph is $7$ -colorable. A pro…

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.CO2020

Random $K_{k}$ -removal algorithm

Fang Tian, Zi-Long Liu, Xiang-Feng Pan

One interesting question is how a graph develops from some constrained random graph process, which is a fundamental mechanism in the formation and evolution of dynamic networks. Th…

math.CO2020

On partial Steiner $(n, r, ℓ)$ -system process

Fang Tian

For given integers $r$ and $ℓ$ such that $2 ⩽ ℓ ⩽ r - 1$ , an $r$ -uniform hypergraph $H$ is called a partial Steiner $(n, r, ℓ)$ -system, if every subset of size $\…

math.CO2019★ 1 cited

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…

A note on the random triadic process

Every toroidal graphs without adjacent triangles is odd 8-colorable

Every toroidal graph without 3-cycles is odd 7-colorable

The odd chromatic number of a toroidal graph is at most 9

Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs

Large induced distance matchings in certain sparse random graphs

On the number of linear multipartite hypergraphs with given size

Random Kk​-removal algorithm

On partial Steiner (n,r,ℓ)-system process

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

Every toroidal graph without $3$ -cycles is odd $7$ -colorable

Random $K_{k}$ -removal algorithm

On partial Steiner $(n, r, ℓ)$ -system process