1 citations · 2 across the 4 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2026
Overtake and the recursive-line equality for second-order Zarankiewicz numbers
Chen Ouyang, Liqun Qi
We study two questions about the second-order Zarankiewicz numbers. The first is the recursive-line equality , known to hold in every computed case and conjec…
math.CO2016
The first few unicyclic and bicyclic hypergraphs with larger spectral radii
Chen Ouyang, Liqun Qi, Xiying Yuan
A connected -uniform hypergraph with vertices and edges is called -cyclic if . For or , the hypergraph is simply called unicyclic or bicyclic.…
math.CO2016★ 1 cited
Some properties and applications of odd-colorable -hypergraphs
Xiying Yuan, Liqun Qi, Jiayu Shao +1
Let and be even. An -hypergraph on vertices is called odd-colorable if there exists a map such that for any edge $\{j_{1},j_{2}…