Vertex isoperimetry and independent set stability for tensor powers of cliques
From MaRDI portal
Publication:5002636
DOI10.4230/LIPIcs.APPROX-RANDOM.2017.33zbMath1470.05123arXiv1702.04432MaRDI QIDQ5002636
Publication date: 28 July 2021
Full work available at URL: https://arxiv.org/abs/1702.04432
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Uses Software
Cites Work
- An approximate vertex-isoperimetric inequality for \(r\)-sets
- Set systems without a simplex or a cluster
- Compressions and isoperimetric inequalities
- On the hardness of approximating minimum vertex cover
- Shadows and intersections: Stability and new proofs
- On the measure of intersecting families, uniqueness and stability
- Graph products, Fourier analysis and spectral techniques
- Independent sets in graph powers are almost contained in juntas
- Fourier analysis and large independent sets in powers of complete graphs
- A new short proof of a theorem of Ahlswede and Khachatrian
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- Intersecting Families are Essentially Contained in Juntas
- Applications of product colouring
- New hardness results for graph and hypergraph colorings
- Invariance principle on the slice
- Harmonicity and invariance on slices of the Boolean cube
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- \(\lambda_{\infty}\), vertex isoperimetry and concentration
This page was built for publication: Vertex isoperimetry and independent set stability for tensor powers of cliques
