Erdős matching conjecture for almost perfect matchings

DOI10.1016/J.DISC.2022.113304MaRDI QIDQ2685338zbMATH OpenOpenAlexWikidataFDO

Authors Dmitriy Kolupaev, Andrey B. Kupavskii

Publication date 21 February 2023

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Erdős matching conjectureextremal set theoryhypergraph matchings

Mathematics Subject Classification ID

Enumerative combinatorics (05Axx) Graph theory (05Cxx) Extremal combinatorics (05Dxx)

Recommendations

• Perfect matchings in hypergraphs and the Erdős matching conjecture
• A generalization of Erdős' matching conjecture
• The Erdős matching conjecture and concentration inequalities
• Erdős-Ko-Rado for perfect matchings
• Beyond the Erdős matching conjecture
• Matchings and Hadwiger's conjecture
• Improved bounds for Erdős' matching conjecture
• Matching theory and Barnette's conjecture
• On the random version of the Erdős matching conjecture
• An Erdős-Ko-Rado theorem for matchings in the complete graph

Cites work

• scientific article; zbMATH DE number 4029608 (Why is no real title available?)
• scientific article; zbMATH DE number 3221072 (Why is no real title available?)
• Improved bounds for Erdős' matching conjecture
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• Maximal number of subsets of a finite set No k of which are pairwise disjoint
• On the maximum number of edges in a hypergraph with given matching number
• Proof of the Erdős matching conjecture in a new range
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• The Erdős matching conjecture and concentration inequalities
• The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
• The size of a hypergraph and its matching number

Cited in

(16)

• Bipartite matching and Van der Waerden conjecture
• Proof of the Erdős matching conjecture in a new range
• Beyond the Erdős matching conjecture
• Factorially many maximum matchings close to the Erdős-Gallai bound
• Improved bounds for Erdős' matching conjecture
• The proof of the Perepechko’s conjecture concerning near-perfect matchings on Cm x Pn cylinders of odd order
• An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
• Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs
• Erd\H{o}s Matching Conjecture for almost perfect matchings
• Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs
• Some results around the Erdős matching conjecture
• A stability result for almost perfect matchings
• The minimum number of cliques in induced subgraphs of Johnson graphs
• Two questions on Kneser colorings
• Maximum size of a graph with given matching number and covering number
• Linear dependencies, polynomial factors in the Duke-Erdős forbidden sunflower problem

This page was built for publication: Erdős matching conjecture for almost perfect matchings

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