A survey on recurrence relations for the independence polynomial of hypergraphs

DOI10.1007/S00373-016-1685-ZzbMath1349.05173arXiv1406.2990OpenAlexW2277921154MaRDI QIDQ343776

Martin Trinks

Publication date: 29 November 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.2990

zbMATH Keywords

hypergraphrecurrence relationindependent setsedge operationindependence polynomialvertex operation

Mathematics Subject Classification ID

Graph polynomials (05C31) Hypergraphs (05C65) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Unnamed Item ⋮ On P-unique hypergraphs ⋮ Independence polynomials of bipartite graphs

Cites Work

• The covered components polynomial: a new representation of the edge elimination polynomial
• From a zoo to a zoology: Towards a general theory of graph polynomials
• Clique polynomials and independent set polynomials of graphs
• Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
• The vertex-cover polynomial of a graph
• Theory of monomer-dimer systems
• The Merrifield–Simmons Conjecture Holds for Bipartite Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A survey on recurrence relations for the independence polynomial of hypergraphs