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 条

[31] MAXIMUM NUMBER OF EDGES IN CONNECTED GRAPHS WITH A GIVEN DOMINATION NUMBER
SANCHIS, LA
DISCRETE MATHEMATICS, 1991, 87 (01) : 65 - 72
[32] On the number of edges in graphs with a given weakly connected domination number
Sanchis, LA
DISCRETE MATHEMATICS, 2002, 257 (01) : 111 - 124
[33] Graphs with second smallest number of perfect matchings of line graphs
Liu, Yan
Zhou, Xue
ARS COMBINATORIA, 2020, 153 : 15 - 31
[34] Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices
He, Xiaocong
Li, Shuchao
Zhao, Qin
DISCRETE APPLIED MATHEMATICS, 2019, 271 : 49 - 63
[35] Upper bounds for the forgotten topological index of graphs with given domination number
Alyar, S.
Khoeilar, R.
ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2021, 14 (09)
[36] GRAPHS ON UNLABELLED NODES WITH A GIVEN NUMBER OF EDGES
WRIGHT, EM
ACTA MATHEMATICA UPPSALA, 1971, 126 (1-2): : 1 - &
[37] Connected cubic graphs with the maximum number of perfect matchings
Horak, Peter
Kim, Dongryul
JOURNAL OF GRAPH THEORY, 2022, 99 (04) : 671 - 690
[38] ON THE EXPECTED NUMBER OF PERFECT MATCHINGS IN CUBIC PLANAR GRAPHS
Noy, Marc
Requile, Clement
Rue, Juanjo
PUBLICACIONS MATEMATIQUES, 2022, 66 (01) : 325 - 353
[39] A bound on the number of perfect matchings in Klee-graphs
Cygan, Marek
Pilipczuk, Marcin
Skrekovski, Riste
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2013, 15 (01): : 37 - 52
[40] A common asymptotic behavior for different classes of sparse labelled graphs with given number of vertices and edges
Ravelomanana, V
Thimonier, L
FORMAL POWER SERIES AND ALGEBRAIC COMBINATORICS, 2000, : 309 - 319

← 1 2 3 4 5 →