scientific article; zbMATH DE number 1323481

MaRDI QIDQ4255352zbMATH OpenFDO

Authors Heike Althöfer

Publication date 11 August 1999

zbMATH Keywords

bipartite graphShannon capacitypacking numbermatching problemmaximal matchingsindependent edgesmatching numberscodewordsindependent verticesdecoding setshypergraph packing problemmatching channelvertex independence problem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• The number of matchings in random regular graphs and bipartite graphs
• Some elementary lower bounds on the matching number of bipartite graphs
• Capacities of graphs and \(2\)-matchings
• On the number of perfect matchings for some certain types of bipartite graphs
• On the number of perfect matchings in a bipartite graph
• On some parameters related to matching of graph powers
• New lower bounds for matching numbers of general and bipartite graphs
• A note on the number of perfect matchings of bipartite graphs
• On the forced matching numbers of bipartite graphs
• scientific article; zbMATH DE number 7410909

Cited in

(1)

• Capacities of graphs and \(2\)-matchings

This page was built for publication:

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