Pages that link to "Item:Q1040835"

The following pages link to Matchings and independent sets of a fixed size in regular graphs (Q1040835):

Displaying 23 items.

• Asymptotics of the upper matching conjecture (Q385029) (← links)
• Independent sets and matchings in subcubic graphs (Q427833) (← links)
• The independent set sequence of regular bipartite graphs (Q449128) (← links)
• Independent sets in graphs (Q501998) (← links)
• An entropy proof of the Kahn-Lovász theorem (Q625372) (← links)
• Independent sets versus perfect matchings (Q673116) (← links)
• On the validations of the asymptotic matching conjectures (Q1012650) (← links)
• An asymptotic independence theorem for the number of matchings in graphs (Q1043805) (← links)
• An upper bound for the number of independent sets in regular graphs (Q1045204) (← links)
• Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs (Q1618724) (← links)
• A proof of the upper matching conjecture for large graphs (Q1984527) (← links)
• Counting sum-free sets in abelian groups (Q2017119) (← links)
• Regular graphs with equal matching number and independence number (Q2074360) (← links)
• From matchings to independent sets (Q2403787) (← links)
• An entropy approach to the hard-core model on bipartite graphs (Q2731583) (← links)
• Entropy, independent sets and antichains: A new approach to Dedekind's problem (Q2758972) (← links)
• Birthday inequalities, repulsion, and hard spheres (Q2796735) (← links)
• The Number of Independent Sets in a Regular Graph (Q3557538) (← links)
• Matchings in regular graphs‎: ‎minimizing the partition function (Q4997230) (← links)
• On Independent Sets in Graphs with Given Minimum Degree (Q5397737) (← links)
• Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree (Q5418775) (← links)
• Tight bounds on the coefficients of partition functions via stability (Q5915725) (← links)
• Tight bounds on the coefficients of partition functions via stability (Q5970255) (← links)