Independent sets on path-schemes

MaRDI QIDQ5395438zbMATH OpenFDO

Authors Sergey Kitaev

Publication date 30 October 2006

Full work available at URL https://eudml.org/doc/52857, http://www.emis.de/journals/JIS/VOL9/Kitaev/kitaev45.html

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

zbMATH Keywords

generating function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorics on words (68R15)

Recommendations

• Counting independent sets in some classes of (almost) regular graphs
• Fibonacci numbers of generalized Zykov sums
• On the number of independent sets in graphs with fixed independence number
• scientific article; zbMATH DE number 3950568
• Bounds on the number of vertex independent sets in a graph

Cited in

(9)

• Independent sets which meet all longest paths
• Counting independent sets in Riordan graphs
• On uniquely k-determined permutations
• Counting independent sets in some classes of (almost) regular graphs
• scientific article; zbMATH DE number 1163872 (Why is no real title available?)
• Asymptotics of Selberg-like integrals: the unitary case and Newton's interpolation formula
• Counting numerical semigroups by Frobenius number, multiplicity, and depth
• Connections between combinations without specified separations and strongly restricted permutations, compositions, and bit strings
• Combinations without specified separations

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Independent sets on path-schemes

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