Search: onr:"swepub:oai:DiVA.org:umu-99326" > Upper bounds on the...
Fältnamn | Indikatorer | Metadata |
---|---|---|
000 | 01861naa a2200337 4500 | |
001 | oai:DiVA.org:umu-99326 | |
003 | SwePub | |
008 | 150206s2015 | |||||||||||000 ||eng| | |
024 | 7 | a https://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-993262 URI |
024 | 7 | a https://doi.org/10.1016/j.ejc.2014.11.0012 DOI |
040 | a (SwePub)umu | |
041 | a engb eng | |
042 | 9 SwePub | |
072 | 7 | a ref2 swepub-contenttype |
072 | 7 | a art2 swepub-publicationtype |
100 | 1 | a Aaghabali, M.4 aut |
245 | 1 0 | a Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges |
264 | 1 | b Elsevier BV,c 2015 |
338 | a print2 rdacarrier | |
520 | a 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. | |
650 | 7 | a NATURVETENSKAPx Matematikx Diskret matematik0 (SwePub)101042 hsv//swe |
650 | 7 | a NATURAL SCIENCESx Mathematicsx Discrete Mathematics0 (SwePub)101042 hsv//eng |
700 | 1 | a Akbari, S.4 aut |
700 | 1 | a Friedland, S.4 aut |
700 | 1 | a Markström, Klasu Umeå universitet,Institutionen för matematik och matematisk statistik4 aut0 (Swepub:umu)klma0001 |
700 | 1 | a Tajfirouz, Z.4 aut |
710 | 2 | a Umeå universitetb Institutionen för matematik och matematisk statistik4 org |
773 | 0 | t European journal of combinatorics (Print)d : Elsevier BVg 45, s. 132-144q 45<132-144x 0195-6698x 1095-9971 |
856 | 4 | u https://doi.org/10.1016/j.ejc.2014.11.001 |
856 | 4 8 | u https://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-99326 |
856 | 4 8 | u https://doi.org/10.1016/j.ejc.2014.11.001 |
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.