A note on exact minimum degree threshold for fractional perfect matchings

DOI10.1007/S00373-022-02475-1zbMath1491.05144arXiv2104.00518OpenAlexW3142773925MaRDI QIDQ2124789

Hongliang Lu, Xingxing Yu

Publication date: 11 April 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphsmatchingsfractional matching number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Maximum size of a graph with given fractional matching number

Cites Work

• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
• Perfect matchings in uniform hypergraphs with large minimum degree
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• Beyond the Erdős matching conjecture
• Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
• Fractional and integer matchings in uniform hypergraphs
• Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture

This page was built for publication: A note on exact minimum degree threshold for fractional perfect matchings