7 citations · 61 across the 41 of their papers we have counts for
31 papers · 1 filter
Extremal hypergraphs without generalized 4-cycles
Hao Huang, Jie Ma, Tianchi Yang
In 1977, Erdős posed the problem of determining the maximum number of edges in an -vertex -uniform hypergraph in which all disjoint pairs of edges have distinct unio…
On the -th largest degree of an intersecting family
Hao Huang, Rui Rao
Let be an intersecting family. For an element , the degree of is the number of sets in that contain . Assume that t…
Sharing tea on a graph
J. Pascal Gollin, Kevin Hendrey, Hao Huang +6
Motivated by the analysis of consensus formation in the Deffuant model for social interaction, we consider the following procedure on a graph . Initially, there is one unit of t…
A non-uniform extension of Baranyai's Theorem
Jinye He, Hao Huang, Jie Ma
A celebrated theorem of Baranyai states that when divides , the family of all -subsets of an -element set can be partitioned into perfect matchings. In other w…
Successive vertex orderings of fully regular graphs
Lixing Fang, Hao Huang, Janos Pach +2
A graph G = (V,E) is called fully regular if for every independent set , the number of vertices in I that are not connected to any element of I depends on…
On local Turán problems
Peter Frankl, Hao Huang, Vojtěch Rödl
Since its formulation, Turán's hypergraph problems have been among the most challenging open problems in extremal combinatorics. One of them is the following: given a -uniform h…