The junta method in extremal hypergraph theory and Chvátal's conjecture

DOI10.1016/j.endm.2017.07.027zbMath1379.05083arXiv1707.02643OpenAlexW2744160631WikidataQ123219023 ScholiaQ123219023MaRDI QIDQ1689997

Noam Lifshitz, Nathan Keller

Publication date: 18 January 2018

Full work available at URL: https://arxiv.org/abs/1707.02643

zbMATH Keywords

Erdős-Ko-Rado theoremdiscrete Fourier analysisChvátal's conjectureTurán-type problemsjuntasextremal hypergraph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Permutations, words, matrices (05A05)

Related Items (13)

The weighted complete intersection theorem ⋮ Diversity of uniform intersecting families ⋮ On the number of distinct differences in an intersecting family ⋮ Towards a proof of the Fourier-entropy conjecture? ⋮ Partitioning ordered hypergraphs ⋮ On set systems without a simplex-cluster and the junta method ⋮ Simple juntas for shifted families ⋮ On the \(d\)-cluster generalization of Erdős-Ko-Rado ⋮ Chromatic numbers of Kneser-type graphs ⋮ Families of finite sets satisfying intersection restrictions ⋮ Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman ⋮ Hypergraphs Not Containing a Tight Tree with a Bounded Trunk ⋮ Regular intersecting families

Cites Work

• Improved bounds for Erdős' matching conjecture
• Turán problems and shadows. I: Paths and cycles
• Set systems without a simplex or a cluster
• On the hardness of approximating minimum vertex cover
• Exact solution of some Turán-type problems
• Proof of a conjecture of Erdős on triangles in set-systems
• Triangle-intersecting families of graphs
• Intersecting Families are Essentially Contained in Juntas
• An Extremal Set-Intersection Theorem
• Sharp thresholds of graph properties, and the $k$-sat problem

This page was built for publication: The junta method in extremal hypergraph theory and Chvátal's conjecture