Maximum size of a graph with given fractional matching number

DOI10.37236/11022OpenAlexW4294947917WikidataQ114023883 ScholiaQ114023883MaRDI QIDQ2088698

Tianlong Ma, Chao Shi, Jian Guo Qian

Publication date: 6 October 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/11022

zbMATH Keywords

extremal problemsfractional matching number

Mathematics Subject Classification ID

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

Related Items (1)

A note on maximum size of a graph without isolated vertices under the given matching number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• Generalization of Erdős-Gallai edge bound
• On the maximum number of edges in a hypergraph with given matching number
• Graphs with restricted valency and matching number
• Matching theory
• Degrees and matchings
• The k-factor conjecture is true
• The Erdős matching conjecture and concentration inequalities
• On maximal paths and circuits of graphs

This page was built for publication: Maximum size of a graph with given fractional matching number