Counting independent sets in graphs

نتاج البحث: نشر في مجلةمقالةمراجعة النظراء

ملخص

In this short survey article, we present an elementary, yet quite powerful, method of enumerating independent sets in graphs. This method was first employed more than three decades ago by Kleitman and Winston and has subsequently been used numerous times by many researchers in various contexts. Our presentation of the method is illustrated with several applications of it to 'real-life' combinatorial problems. In particular, we derive bounds on the number of independent sets in regular graphs, sum-free subsets of {1,..., n}, and C4-free graphs and give a short proof of an analogue of Roth's theorem on 3-term arithmetic progressions in sparse random sets of integers which was originally formulated and proved by Kohayakawa, Łuczak, and Rödl.

اللغة الأصليةالإنجليزيّة
الصفحات (من إلى)5-18
عدد الصفحات14
دوريةEuropean Journal of Combinatorics
مستوى الصوت48
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 1 أغسطس 2015

All Science Journal Classification (ASJC) codes

  • !!Discrete Mathematics and Combinatorics

بصمة

أدرس بدقة موضوعات البحث “Counting independent sets in graphs'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا