The maximum number of perfect matchings in graphs with a given degree sequence
From MaRDI portal
Publication:1010667
zbMath1183.05064arXiv0803.2578MaRDI QIDQ1010667
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.2578
05A15: Exact enumeration problems, generating functions
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C07: Vertex degrees
Related Items
Extremal Graphs With a Given Number of Perfect Matchings, Tight bounds on the coefficients of partition functions via stability, Unnamed Item, Connected cubic graphs with the maximum number of perfect matchings, Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs, Asymptotics of the upper matching conjecture, On the size and structure of graphs with a constant number of 1-factors, Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges, On the numbers of 1-factors and 1-factorizations of hypergraphs, Graphs with the fewest matchings, Entropy bounds for perfect matchings and Hamiltonian cycles, Graphs with the maximum or minimum number of 1-factors, Enumerating the edge-colourings and total colourings of a regular graph, On the expected number of perfect matchings in cubic planar graphs, Number of 1-factorizations of regular high-degree graphs, On the number of 1-factorizations of a complete graph, A general law of large permanent, Colorings with few colors: counting, enumeration and combinatorial bounds, Results and questions on matchings in abelian groups and vector subspaces of fields, The graphs of stably matchable pairs, Almost all optimally coloured complete graphs contain a rainbow Hamilton path, Asymptotics for Shamir's problem, An upper bound on the number of Steiner triple systems, Permanents of multidimensional matrices: Properties and applications, Anagram-Free Colourings of Graphs, Statistical Matching Theory
