On the matching polynomial of hypergraphs

MaRDI QIDQ5241134zbMATH OpenFDO

Authors Yaping Mao, Zhiwei Guo, Haixing Zhao

Publication date 30 October 2019

zbMATH Keywords

hypergraphindependence polynomialmatching polynomialline-graph

Mathematics Subject Classification ID

Graph polynomials (05C31) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On ``The matching polynomial of a polygraph
• scientific article; zbMATH DE number 861360
• The higher-order matching polynomial of a graph
• Matching polynomials and duality
• scientific article; zbMATH DE number 3989395

Cites work

• scientific article; zbMATH DE number 3836093 (Why is no real title available?)
• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• A geometric theory for hypergraph matching
• A new expression for matching polynomials
• A survey on recurrence relations for the independence polynomial of hypergraphs
• An introduction to matching polynomials
• Hypergraph theory. An introduction
• Independence polynomials of \(k\)-tree related graphs
• Matching polynomials for chains of cycles
• Matching polynomials of two classes of graphs
• Multivariate matching polynomials of cyclically labelled graphs
• Near perfect matchings in \(k\)-uniform hypergraphs
• Nearly perfect matchings in regular simple hypergraphs
• On linear and semidefinite programming relaxations for hypergraph matching
• On multivariate chromatic polynomials of hypergraphs and hyperedge elimination
• On the theory of the matching polynomial
• Proving properties of the edge elimination polynomial using equivalent graph polynomials
• The independence polynomial of rooted products of graphs
• The matching polynomial of a regular graph
• The size of a hypergraph and its matching number

Cited in

(19)

• scientific article; zbMATH DE number 4191717 (Why is no real title available?)
• A Pfaffian formula for matching polynomials of outerplanar graphs
• Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs
• Matching polynomials and duality
• Matchings in hypergraphs of large minimum degree
• The matching polynomials of hypergraphs and weighted hypergraphs
• A geometric theory for hypergraph matching
• On ``The matching polynomial of a polygraph
• Monochromatic matchings in the shadow graph of almost complete hypergraphs
• scientific article; zbMATH DE number 26485 (Why is no real title available?)
• The higher-order matching polynomial of a graph
• More on the sixth coefficient of the matching polynomial in regular graphs
• scientific article; zbMATH DE number 6148021 (Why is no real title available?)
• The \(N\)-dimensional matching polynomial
• A survey on recurrence relations for the independence polynomial of hypergraphs
• scientific article; zbMATH DE number 3989395 (Why is no real title available?)
• Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture
• On \(P\)-unique hypergraphs
• scientific article; zbMATH DE number 4025483 (Why is no real title available?)

This page was built for publication: On the matching polynomial of hypergraphs

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