Generalization of Erdős-Gallai edge bound

DOI10.1016/j.ejc.2014.07.004zbMath1301.05189OpenAlexW2073734374MaRDI QIDQ458592

Niraj Khare, Naushad Puliyambalath, Nishali Mehta

Publication date: 8 October 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2014.07.004

zbMATH Keywords

extremal graphsErdős-Gallai bound

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (1)

Maximum size of a graph with given fractional matching number

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Graphs with restricted valency and matching number
• Matching theory
• Degrees and matchings
• Intersection theorems for systems of sets
• Intersection Theorems for Systems of Sets
• On the size of graphs with complete-factors

This page was built for publication: Generalization of Erdős-Gallai edge bound