3 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2014★ 3 cited
Cycles with consecutive odd lengths
Jie Ma
It is proved that there exists an absolute constant c > 0 such that for every natural number k, every non-bipartite 2-connected graph with average degree at least ck contains k cyc…
math.CO2012
A problem of Erdős on the minimum number of -cliques
Shagnik Das, Hao Huang, Jie Ma +2
Fifty years ago Erdős asked to determine the minimum number of -cliques in a graph on vertices with independence number less than l. He conjectured that this minimum is achi…
math.CO2012
Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs
Hao Huang, Jie Ma, Asaf Shapira +2
A minimum feedback arc set of a directed graph is a smallest set of arcs whose removal makes acyclic. Its cardinality is denoted by . We show that an Eulerian digraph…