Murong Xu

collaborators

2 papers

math.CO2018

On the sizes of $(k, l)$ -edge-maximal $r$ -uniform hypergraphs

Yingzhi Tian, Hong-Jian Lai, Jixiang Meng +1

Let $H = (V, E)$ be a hypergraph, where $V$ is a set of vertices and $E$ is a set of non-empty subsets of $V$ called edges. If all edges of $H$ have the same cardinality $r$ , then $H$ …

math.CO2018

On the sizes of $k$ -edge-maximal $r$ -uniform hypergraphs

Yingzhi Tian, Liqiong Xu, Hong-Jian Lai +1

Let $H = (V, E)$ be a hypergraph, where $V$ is a set of vertices and $E$ is a set of non-empty subsets of $V$ called edges. If all edges of $H$ have the same cardinality $r$ , then $H$ …

On the sizes of (k,l)-edge-maximal r-uniform hypergraphs

On the sizes of k-edge-maximal r-uniform hypergraphs

On the sizes of $(k, l)$ -edge-maximal $r$ -uniform hypergraphs

On the sizes of $k$ -edge-maximal $r$ -uniform hypergraphs