An Algorithmic Study of the Hypergraph Turán Problem

We propose an algorithmic version of the hypergraph Turan problem (AHTP): given a $t$-uniform hypergraph $H=(V,E)$, the goal is to find the smallest collection of $(t-1)$-element subsets of $V$ such that every hyperedge $e \in E$ contains one of these subsets. In addition to its inherent combinatorial interest---for instance, the $t=3$ case is connected to Tuza's famous conjecture on covering triangles of a graph with edges---variants of AHTP arise in recently proposed reductions to fundamental Euclidean clustering problems. AHTP admits a trivial factor $t$ approximation algorithm as it can be cast as an instance of vertex cover on a structured $t$-uniform hypergraph that is a ``blown-up'' version of $H$. Our main result is an approximation algorithm with ratio $\frac{t}{2}+o(t)$. The algorithm is based on rounding the natural LP relaxation using a careful combination of thresholding and color coding. We also present results motivated by structural aspects of the blown-up hypergraph. The blown-up is a $\textit{simple}$ hypergraph with hyperedges intersecting in at most one element. We prove that vertex cover on simple $t$-uniform hypergraphs is as hard to approximate as general $t$-uniform hypergraphs. The blown-up hypergraph further has many forbidden structures, including a ``tent'' structure for the case $t=3$. Whether a generalization of Tuza's conjecture could also hold for tent-free $3$-uniform hypergraphs was posed in a recent work. We answer this question in the negative by giving a construction based on combinatorial lines that is tent-free, and yet needs to include most of the vertices in a vertex cover.

[1]  Zsolt Tuza A conjecture on triangles of graphs , 1990, Graphs Comb..

[2]  Yi Zhao,et al.  An Exact Result for Hypergraphs and Upper Bounds for the Tur[a-acute]n Density of Krr+1 , 2009, SIAM J. Discret. Math..

[3]  Paul Erdös,et al.  On the combinatorial problems which I would most like to see solved , 1981, Comb..

[4]  Alexander Sidorenko,et al.  What we know and what we do not know about Turán numbers , 1995, Graphs Comb..

[5]  Alexander Sidorenko,et al.  Upper Bounds for Turán Numbers , 1997, J. Comb. Theory, Ser. A.

[6]  Marek Cygan,et al.  Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[7]  Siu On Chan Approximation Resistance from Pairwise-Independent Subgroups , 2016, J. ACM.

[8]  Michael Krivelevich,et al.  On a conjecture of Tuza about packing and covering of triangles , 1995, Discret. Math..

[9]  Ron Aharoni,et al.  A generalization of Tuza's conjecture , 2020, J. Graph Theory.

[10]  Fan Chung Graham,et al.  An Upper Bound for the Turán Number t3(n,4) , 1999, J. Comb. Theory, Ser. A.

[11]  Ron Holzman,et al.  On a theorem of lovász on covers inr-partite hypergraphs , 1996, Comb..

[12]  H. Furstenberg,et al.  A density version of the Hales-Jewett theorem , 1991 .

[13]  P. Erdös On an extremal problem in graph theory , 1970 .

[14]  Brendan D. McKay,et al.  On Ryser's conjecture for linear intersecting multipartite hypergraphs , 2015, Eur. J. Comb..

[15]  Jean Cardinal,et al.  Approximating vertex cover in dense hypergraphs , 2010, J. Discrete Algorithms.

[16]  Peter Keevash Surveys in Combinatorics 2011: Hypergraph Turán problems , 2011 .

[17]  Ki Hang Kim,et al.  On a problem of Turán , 1983 .

[18]  Subhash Khot Hardness results for approximate hypergraph coloring , 2002, STOC '02.

[19]  D. Polymath,et al.  A new proof of the density Hales-Jewett theorem , 2009, 0910.3926.