Pages that link to "Item:Q1010667"

The following pages link to The maximum number of perfect matchings in graphs with a given degree sequence (Q1010667):

Displayed 26 items.

• Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs (Q322196) ‎ (← links)
• Asymptotics of the upper matching conjecture (Q385029) ‎ (← links)
• On the size and structure of graphs with a constant number of 1-factors (Q418889) ‎ (← links)
• Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges (Q482134) ‎ (← links)
• On the numbers of 1-factors and 1-factorizations of hypergraphs (Q507504) ‎ (← links)
• Graphs with the fewest matchings (Q524194) ‎ (← links)
• Entropy bounds for perfect matchings and Hamiltonian cycles (Q624182) ‎ (← links)
• Graphs with the maximum or minimum number of 1-factors (Q965940) ‎ (← links)
• Enumerating the edge-colourings and total colourings of a regular graph (Q1956248) ‎ (← links)
• On the expected number of perfect matchings in cubic planar graphs (Q2075311) ‎ (← links)
• Number of 1-factorizations of regular high-degree graphs (Q2220965) ‎ (← links)
• On the number of 1-factorizations of a complete graph (Q2352638) ‎ (← links)
• A general law of large permanent (Q2362303) ‎ (← links)
• Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) ‎ (← links)
• Results and questions on matchings in abelian groups and vector subspaces of fields (Q2667904) ‎ (← links)
• The graphs of stably matchable pairs (Q2672447) ‎ (← links)
• Almost all optimally coloured complete graphs contain a rainbow Hamilton path (Q2673480) ‎ (← links)
• Asymptotics for Shamir's problem (Q2700633) ‎ (← links)
• An upper bound on the number of Steiner triple systems (Q2868080) ‎ (← links)
• Permanents of multidimensional matrices: Properties and applications (Q2959191) ‎ (← links)
• Anagram-Free Colourings of Graphs (Q3177364) ‎ (← links)
• Statistical Matching Theory (Q3295266) ‎ (← links)
• Extremal Graphs With a Given Number of Perfect Matchings (Q5325953) ‎ (← links)
• Tight bounds on the coefficients of partition functions via stability (Q5970255) ‎ (← links)
• Connected cubic graphs with the maximum number of perfect matchings (Q6057662) ‎ (← links)
• (Q6104048) ‎ (← links)