Pages that link to "Item:Q4553732"

The following pages link to Tight lower bounds on the matching number in a graph with given maximum degree (Q4553732):

Displaying 30 items.

• Tight bound for matching (Q431927) (← links)
• Bounds on maximum \(b\)-matchings (Q1043589) (← links)
• Nordhaus-Gaddum type result for the matching number of a graph (Q1680497) (← links)
• Lower bounds on the uniquely restricted matching number (Q1733882) (← links)
• Note on extremal graphs with given matching number (Q1738091) (← links)
• Tight bounds on maximal and maximum matchings (Q1877645) (← links)
• A characterization of graphs with given maximum degree and smallest possible matching number (Q2032746) (← links)
• Matching and edge-connectivity in graphs with given maximum degree (Q2032857) (← links)
• A characterization of graphs with given maximum degree and smallest possible matching number. II (Q2065903) (← links)
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues (Q2066004) (← links)
• A generalization of Petersen's matching theorem (Q2111920) (← links)
• Factorially many maximum matchings close to the Erdős-Gallai bound (Q2152791) (← links)
• Transversals and independence in linear hypergraphs with maximum degree two (Q2363113) (← links)
• Erratum to: Tight bound for matching (Q2392740) (← links)
• Uniquely restricted matchings in subcubic graphs (Q2416436) (← links)
• Tight lower bounds on the size of a maximum matching in a regular graph (Q2478167) (← links)
• Building large \(k\)-cores from sparse graphs (Q2678255) (← links)
• Sharp bounds for the number of matchings in generalized-theta-graphs (Q2866420) (← links)
• Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (Q3010427) (← links)
• Matching for Graphs of Bounded Degree (Q3507330) (← links)
• (Q3567544) (← links)
• (Q4474098) (← links)
• (Q5089202) (← links)
• On Lower Bounds for the Matching Number of Subcubic Graphs (Q5272918) (← links)
• On the maximum number of edges in chordal graphs of bounded degree and matching number (Q5970781) (← links)
• A complete description of convex sets associated with matchings and edge‐connectivity in graphs (Q6046646) (← links)
• A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number (Q6055403) (← links)
• Uniquely restricted matchings in subcubic graphs without short cycles (Q6055410) (← links)
• On the matching number of \(k\)-uniform connected hypergraphs with maximum degree (Q6535802) (← links)
• Gated independence in graphs (Q6546421) (← links)