Pages that link to "Item:Q2439573"

The following pages link to On Erdős' extremal problem on matchings in hypergraphs (Q2439573):

Displaying 36 items.

• On the maximum number of edges in a hypergraph with given matching number (Q516783) (← links)
• The minimum number of disjoint pairs in set systems and related problems (Q524186) (← links)
• Rainbow matchings in properly-colored hypergraphs (Q668047) (← links)
• Extremal \(G\)-free induced subgraphs of Kneser graphs (Q725003) (← links)
• Proof of the Erdős matching conjecture in a new range (Q1686318) (← links)
• On maximal tail probability of sums of nonnegative, independent and identically distributed random variables (Q1687185) (← links)
• Families with no matchings of size \(s\) (Q1689961) (← links)
• A short proof of Erdős' conjecture for triple systems (Q1701428) (← links)
• On the random version of the Erdős matching conjecture (Q1720300) (← links)
• A generalization of Erdős' matching conjecture (Q1753109) (← links)
• Rainbow matchings for 3-uniform hypergraphs (Q2040498) (← links)
• On the size of the product of overlapping families (Q2084272) (← links)
• On the rainbow matching conjecture for 3-uniform hypergraphs (Q2090427) (← links)
• Size and structure of large \((s,t)\)-union intersecting families (Q2138583) (← links)
• The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
• Structure of the largest subgraphs of \(G_{n , p}\) with a given matching number (Q2222927) (← links)
• On the maximum size of subfamilies of labeled set with given matching number (Q2279764) (← links)
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman (Q2312621) (← links)
• Vertex degree sums for matchings in 3-uniform hypergraphs (Q2327218) (← links)
• Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture (Q2397107) (← links)
• Linear trees in uniform hypergraphs (Q2509754) (← links)
• The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs (Q2629296) (← links)
• A better bound on the size of rainbow matchings (Q2680820) (← links)
• The structure of large intersecting families (Q2970053) (← links)
• Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture (Q3178439) (← links)
• On Rainbow Matchings for Hypergraphs (Q4602861) (← links)
• A Stability Result on Matchings in 3-Uniform Hypergraphs (Q5043638) (← links)
• Rainbow Perfect Matchings for 4-Uniform Hypergraphs (Q5093585) (← links)
• Rainbow version of the Erdős Matching Conjecture via concentration (Q5886247) (← links)
• Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs (Q6046825) (← links)
• Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs (Q6081575) (← links)
• Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs (Q6098072) (← links)
• Vertex degree sums for matchings in 3-uniform hypergraphs (Q6494941) (← links)
• Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs (Q6568850) (← links)
• Some results around the Erdős matching conjecture (Q6621203) (← links)
• Lagrangian densities of 4-uniform matchings and degree stability of extremal hypergraphs (Q6635102) (← links)