Fang Tian

collaborators

2 papers

math.CO2025

On the number of linear uniform hypergraphs with linear girth constraint

Fang Tian, Yiting Yang, Xiying Yuan

For an integer $r ⩾ 3$ , a hypergraph on vertex set $[n]$ is $r$ -uniform if each edge is a set of $r$ vertices, and is said to be linear if every two distinct edges share at…

math.CO2025

Subgraphs in random graphs with specified degrees and forbidden edges

John Larkin, Brendan D. McKay, Fang Tian

Let $G$ be a uniformly chosen simple (labelled) random graph with given degree sequence $d$ and let $X, Y, L$ be edge-disjoint graphs on the same vertex set as $G$ . We i…