Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges

被引：7

作者：

Aaghabali, M. ^{[3
]}

Akbari, S. ^{[1
,4
]}

Friedland, S. ^{[2
]}

Markstroem, K. ^{[5
]}

Tajfirouz, Z. ^{[3
]}

机构：

[1] Sharif Univ Technol, Dept Math Sci, Tehran, Iran

[2] Univ Illinois, Dept Math Stat & Comp Sci, Chicago, IL USA

[3] Univ Zanjan, Dept Math, Zanjan, Iran

[4] Inst Studies Theoret Phys & Math IPM, Tehran, Iran

[5] Umea Univ, Dept Math & Math Stat, S-90187 Umea, Sweden

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 2015年 / 45卷

基金：

美国国家科学基金会;

关键词：

PERMANENT;

D O I：

10.1016/j.ejc.2014.11.001

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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. (C) 2014 Elsevier Ltd. All rights reserved.

引用

页码：132 / 144

页数：13

共 50 条

[41] A quadratic identity for the number of perfect matchings of plane graphs
Yan, Weigen
Zhang, Fuji
THEORETICAL COMPUTER SCIENCE, 2008, 409 (03) : 405 - 410
[42] New upper bounds on the spectral radius of trees with the given number of vertices and maximum degree
Song, Haizhou
Wang, Qiufen
Tian, Lulu
LINEAR ALGEBRA AND ITS APPLICATIONS, 2013, 439 (09) : 2527 - 2541
[43] Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Góra, Z. Szafrana 4a, 65-516 Zielona Góra, Poland
Inf. Process. Lett., 6 (287-290):
[44] Asymptotic enumeration of linear hypergraphs with given number of vertices and edges
McKay, Brendan D.
Tian, Fang
ADVANCES IN APPLIED MATHEMATICS, 2020, 115
[45] The Numbers of Edges of 5-Polytopes with a Given Number of Vertices
Kusunoki, Takuya
Murai, Satoshi
ANNALS OF COMBINATORICS, 2019, 23 (01) : 89 - 101
[46] Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
Fiedorowicz, Anna
INFORMATION PROCESSING LETTERS, 2011, 111 (06) : 287 - 290
[47] The Numbers of Edges of 5-Polytopes with a Given Number of Vertices
Takuya Kusunoki
Satoshi Murai
Annals of Combinatorics, 2019, 23 : 89 - 101
[48] ENUMERATION OF GRAPHS WITH GIVEN NUMBER OF VERTICES OF ODD DEGREE
TAZAWA, S
COMBINATORICS /, 1988, 52 : 515 - 525
[49] Graphs with given odd sets and the least number of vertices
Hakimi, SL
JOURNAL OF GRAPH THEORY, 1997, 24 (01) : 81 - 83
[50] Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices
Zhen, Wenhao
Wong, Dein
Zhang, Yuanshuai
Discrete Applied Mathematics, 2024, 347 : 23 - 29

← 1 2 3 4 5 →