Almost all trees have an even number of independent sets

zbMATH Open1230.05165MaRDI QIDQ2380249FDOQ2380249

Authors: Stephan Wagner 

Publication date: 26 March 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/223562

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• On the number of independent sets in a tree
• On the independent set sequence of a tree
• A Note on Independent Sets in Trees
• On maximal independent sets of nodes in trees
• The number of \(F\)-matchings in almost every tree is a zero residue

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30)

Cited In (11)

• The maximum number of maximum dissociation sets in trees
• Title not available (Why is that?)
• Almost all trees have tribe number 2 or 3
• On the number of independent sets in cycle-separated tricyclic graphs
• On the independent set sequence of a tree
• The number of trees with a 1-factor
• Independent sets in graphs
• The number of \(F\)-matchings in almost every tree is a zero residue
• Minimum number of maximal dissociation sets in trees
• Almost all trees share a complete set of immanantal polynomials
• Trees with extremal numbers of \(k\)-dominating sets

This page was built for publication: Almost all trees have an even number of independent sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380249)