Generalization of Erdős-Gallai edge bound

DOI10.1016/J.EJC.2014.07.004MaRDI QIDQ458592zbMATH OpenOpenAlexFDO

Authors Niraj Khare, Nishali Mehta, Naushad Puliyambalath

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)

Recommendations

• Factorially many maximum matchings close to the Erdős-Gallai bound
• Maximizing the number of cliques in graphs with given matching number
• Graphs with restricted valency and matching number
• Matching and edge-connectivity in graphs with given maximum degree
• Tight bound for matching

Cites work

• scientific article; zbMATH DE number 3166040 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Degrees and matchings
• Graphs with restricted valency and matching number
• Improved bounds for Erdős' matching conjecture
• Intersection Theorems for Systems of Sets
• Intersection theorems for systems of sets
• Matching theory
• On the size of graphs with complete-factors

Cited in

(4)

• scientific article; zbMATH DE number 5572978 (Why is no real title available?)
• Maximizing the number of cliques in graphs with given matching number
• Generalized edge theorem
• Maximum size of a graph with given fractional matching number

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

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