Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

JGT
2016

favoriteEmaildiscussreport

55views more JGT 2016»

A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs

8 years 18 days ago

A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs

Download math.udel.edu

We develop a new method for enumerating independent sets of a ﬁxed size in general graphs, and we use this method to show that a conjecture of Engbers and Galvin holds for all but ﬁnitely many graphs. We also use our method to prove special cases of a conjecture of Kahn. In addition, we show that our method is particularly useful for computing the number of independent sets of small sizes in general regular graphs and Moore graphs, and we argue that it can be used in many other cases when dealing with graphs that have numerous structural restrictions.

James Alexander, Tim Mink

Real-time Traffic

JGT 2016 |

claim paper

Related Content

» A family of metrics for biopolymers based on counting independent sets

» Covering graphs with matchings of fixed size

» Rethinking custom ISE identification a new processoragnostic method

» Fixing MaxProduct Convergent Message Passing Algorithms for MAP LPRelaxations

» Counting Subgraphs via Homomorphisms

» Simulating independence new constructions of condensers ramsey graphs dispersers and extra...

» SPIN mining maximal frequent subgraphs from graph databases

» Improved variance estimation of classification performance via reduction of bias caused by...

» The independence number in graphs of maximum degree three

» Enumeration and exact design of weighted voting games

Post Info
More Details (n/a)

Added	06 Apr 2016
Updated	06 Apr 2016
Type	Journal
Year	2016
Where	JGT
Authors	James Alexander, Tim Mink

Comments (0)