Rainbow version of the Erdős Matching Conjecture via concentration

DOI10.5070/C63160414WikidataQ123221540 ScholiaQ123221540MaRDI QIDQ5886247

Andrey B. Kupavskii

Publication date: 31 March 2023

Published in: Combinatorial Theory (Search for Journal in Brave)

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

zbMATH Keywords

extremal set theoryErdős matching conjecturerainbow version

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improved bounds for Erdős' matching conjecture
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• On the maximum number of edges in a hypergraph with given matching number
• Threshold functions
• Shadows and shifting
• Proof of the Erdős matching conjecture in a new range
• Beyond the Erdős matching conjecture
• On the rainbow matching conjecture for 3-uniform hypergraphs
• The Erdős matching conjecture and concentration inequalities
• The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
• On Erdős' extremal problem on matchings in hypergraphs
• A better bound on the size of rainbow matchings
• On the maximum number of edges in a triple system not containing a disjoint family of a given size
• 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
• Rainbow matchings in k‐partite hypergraphs
• Simple juntas for shifted families
• Maximal number of subsets of a finite set No k of which are pairwise disjoint

Related Items (6)

Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture ⋮ The Erdős matching conjecture and concentration inequalities ⋮ Co-degree threshold for rainbow perfect matchings in uniform hypergraphs ⋮ Extremal Problem for Matchings and Rainbow Matchings on Direct Products ⋮ A proof of Frankl's conjecture on cross-union families ⋮ Transversal Hamilton cycle in hypergraph systems

This page was built for publication: Rainbow version of the Erdős Matching Conjecture via concentration

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