|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'506'133
Articles rated: 2609
26 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
On vertex covers, matchings and random trees | | Stephane Coulomb
; Michel Bauer
; | | Date: |
27 Jul 2004 | | Subject: | Combinatorics; Disordered Systems and Neural Networks | math.CO cond-mat.dis-nn | | Abstract: | We study minimal vertex covers and maximal matchings on trees. We pay special attention to the corresponding backbones i.e. these vertices that are occupied and those that are empty in every minimal vertex cover (resp. these egdes that are occupied and those that are empty in every maximal matching). The key result in our approach is that for trees, the backbones can be recovered from a particular tri-coloring which has a simple characterization. We give applications to the computation of some averages related to the enumeration of minimal vertex covers and maximal matchings in the random labeled tree ensemble, both for finite size and in the asymptotic regime. | | Source: | arXiv, math.CO/0407456 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER