Extremal Problem for Matchings and Rainbow Matchings on Direct Products

DOI10.1137/21m1457990zbMath1528.05056arXiv2111.04423OpenAlexW4386544247MaRDI QIDQ6077978

Jie You, Jian Wang

Publication date: 27 September 2023

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

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

zbMATH Keywords

direct producthypergraph matchingrainbow matchingconcentraction inequality

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• On the maximum number of edges in a hypergraph with given matching number
• Explicit construction of linear sized tolerant networks
• On the sum of sizes of overlapping families
• The Erdős matching conjecture and concentration inequalities
• The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
• An Erdös-Ko-Rado theorem for direct products
• A better bound on the size of rainbow matchings
• The Size of a Hypergraph and its Matching Number
• On maximal paths and circuits of graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• On the Shannon capacity of a graph
• Simple juntas for shifted families
• Intersection theorems for systems of finite sets
• A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem
• Rainbow version of the Erdős Matching Conjecture via concentration

This page was built for publication: Extremal Problem for Matchings and Rainbow Matchings on Direct Products