1 citations · 1 across the 4 of their papers we have counts for
4 papers
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…
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…
Quasi-randomness of graph balanced cut properties
Hao Huang, Choongbum Lee
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yus…
A counterexample to the Alon-Saks-Seymour conjecture and related problems
Hao Huang, Benny Sudakov
Consider a graph obtained by taking edge disjoint union of complete bipartite graphs. Alon, Saks and Seymour conjectured that such graph has chromatic number at most . Thi…