Graphs with restricted valency and matching number

DOI10.1016/j.disc.2008.10.007zbMath1218.05120arXivmath/0611842OpenAlexW1973595346MaRDI QIDQ1043593

Niranjan Balachandran, Niraj Khare

Publication date: 9 December 2009

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

Full work available at URL: https://arxiv.org/abs/math/0611842

zbMATH Keywords

sunflowerfactor-critical graphGallai's lemma

Mathematics Subject Classification ID

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

Related Items (12)

Extremal graphs for edge blow-up of graphs ⋮ On the size of 3-uniform linear hypergraphs ⋮ On the maximum number of edges in planar graphs of bounded degree and matching number ⋮ Graph classes and Ramsey numbers ⋮ Strong chromatic index and Hadwiger number ⋮ Graphs whose edge set can be partitioned into maximum matchings ⋮ The size of 3-uniform hypergraphs with given matching number and codegree ⋮ Generalization of Erdős-Gallai edge bound ⋮ The Turán number for the edge blow-up of trees ⋮ Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded ⋮ Maximum size of a graph with given fractional matching number ⋮ On the maximum number of edges in chordal graphs of bounded degree and matching number

Cites Work

• Matching theory
• Degrees and matchings
• Intersection theorems for systems of sets
• Intersection Theorems for Systems of Sets
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs with restricted valency and matching number