Search: onr:"swepub:oai:DiVA.org:umu-99326" >
Upper bounds on the...
Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges
-
Aaghabali, M. (author)
-
Akbari, S. (author)
-
Friedland, S. (author)
-
show more...
-
- Markström, Klas (author)
- Umeå universitet,Institutionen för matematik och matematisk statistik
-
Tajfirouz, Z. (author)
-
show less...
-
(creator_code:org_t)
- Elsevier BV, 2015
- 2015
- English.
-
In: European journal of combinatorics (Print). - : Elsevier BV. - 0195-6698 .- 1095-9971. ; 45, s. 132-144
- Related links:
-
https://doi.org/10.1...
-
show more...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
show less...
Abstract
Subject headings
Close
- We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on 2n vertices. The upper bound is sharp for even n. For odd n we state a conjecture on a sharp upper bound.
Subject headings
- NATURVETENSKAP -- Matematik -- Diskret matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Discrete Mathematics (hsv//eng)
Publication and Content Type
- ref (subject category)
- art (subject category)
Find in a library
To the university's database