On the number of F-matchings in a tree

zbMATH Open1243.05201MaRDI QIDQ426809FDOQ426809

Authors: Hiu Fai Law 

Publication date: 12 June 2012

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

Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p43

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

Recommendations

• The number of \(F\)-matchings in almost every tree is a zero residue
• On the number of independent sets in a tree
• On the number of matchings of a tree
• Generalized matchings in trees
• The number of maximum matchings in a tree

zbMATH Keywords

random labeled tree

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (8)

• Trees with maximum number of maximal matchings
• Title not available (Why is that?)
• A note on the number of matchings and independent sets in trees
• The number of \(F\)-matchings in almost every tree is a zero residue
• Matchings on trees and the adjacency matrix: A determinantal viewpoint
• Alternating Whitney sums and matchings in trees. 1
• On the number of \(r\)-matchings in a tree
• Number of pairs of template matchings in \(q\)-ary tree with randomly marked vertices

This page was built for publication: On the number of \(F\)-matchings in a tree

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