On the number of independent sets in expanders

DOI10.1515/dma.2001.11.2.155zbMath1048.05065OpenAlexW2069075589MaRDI QIDQ4809520

Alexander A. Sapozhenko

Publication date: 30 August 2004

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2001.11.2.155

zbMATH Keywords

regular graphsindependent sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

Online containers for hypergraphs, with applications to linear equations ⋮ Independent sets in quasi-regular graphs ⋮ On a question of Vera T. Sós about size forcing of graphons ⋮ The Cameron-Erdős conjecture ⋮ Hypergraph containers ⋮ Independent sets in graphs ⋮ List colorings of multipartite hypergraphs

This page was built for publication: On the number of independent sets in expanders