Independence and matching number of some graphs

DOI10.1007/s10878-018-0356-9zbMath1426.90213OpenAlexW2898829747WikidataQ129005750 ScholiaQ129005750MaRDI QIDQ2424729

Yusheng Li, Ming Chen, Yiting Yang

Publication date: 25 June 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0356-9

zbMATH Keywords

independence numbermatching numbermaximum degree

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• On Turan's theorem for sparse graphs
• Finding independent sets in \(K_4\)-free 4-regular connected graphs
• On book-complete graph Ramsey numbers
• Independence and matching number in graphs with maximum degree 4
• Tight lower bounds on the size of a maximum matching in a regular graph
• Independence numbers of locally sparse graphs and a Ramsey type problem
• On the independence number of sparse graphs
• Maximum matching and a polyhedron with 0,1-vertices
• Asymptotic upper bounds for Ramsey functions