Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded

DOI10.1016/J.DISC.2017.01.010zbMATH Open1357.05063OpenAlexW2587214001MaRDI QIDQ512562FDOQ512562

Authors: Cemil Dibek, Pinar Heggernes, Tınaz Ekim 

Publication date: 27 February 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.01.010

Recommendations

• Matching and edge-connectivity in graphs with given maximum degree
• Total domination and matching numbers in claw-free graphs
• Graphs with restricted valency and matching number
• Tight bound for matching
• On the maximum number of edges in hypergraphs with fixed matching and clique number

zbMATH Keywords

Ramsey theoryclaw-free graphsmaximum matchingedge-extremal graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Ramsey theory (05D10)

Cites Work

• On the structure of linear graphs
• Title not available (Why is that?)
• Intersection Theorems for Systems of Sets
• Degrees and matchings
• Chromatic graph theory
• Title not available (Why is that?)
• Graphs with 1-Factors
• Graphs with restricted valency and matching number
• The Roberts characterization of proper and unit interval graphs
• Title not available (Why is that?)

Cited In (4)

• Maximum size of a triangle-free graph with bounded maximum degree and matching number
• On Turán problems with bounded matching number
• On the maximum number of edges in planar graphs of bounded degree and matching number
• On the maximum number of edges in chordal graphs of bounded degree and matching number

This page was built for publication: Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512562)